Longest Common Prefix

class Solution {
public:
    string longestCommonPrefix(vector<string> &strs) {
        int ind, tail, len, tmp;
        len = strs.size();
        if(len == 0) return "";
        if(len == 1) return strs[0];
        ind = 0;
        for(int i=1;i<len;i++){
            if(strs[i].length() < strs[ind].length()){
                ind = i;
            }
        }
        tmp = tail = strs[ind].length() - 1;
        for(int i=0;i<len;i++){
            int k=0;
            while(k<=tmp){
                if(strs[i][k] == strs[ind][k]){
                    k++;
                }
                else break;
            }
            tmp = k-1;
        }
        return strs[ind].substr(0, tmp+1);
    }
};