最长公共前缀

高刷题

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        string result;
        char tmp;
        for (int i=0 ; i <strs[0].size() ; i++)
        {
            for(int j=0 ; j < strs.size() ; j++)
            {
                if(i >= strs[j].size()) return result;
                if(j==0)
                {
                    tmp = strs[j][i];
                    continue;
                }
                if(strs[j][i] != tmp) return result;
            }
            result += tmp;
        }
        return result;
      
    }
};