【LeetCode】14

Write a function to find the longest common prefix string amongst an array of strings.

Solution：

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {      //runtime:4ms
        string str="";
        if(strs.empty())return str;
        int index=0;
        
        while(true){    
            if(index>=strs[0].size())return str;
            char c=strs[0][index];
            for(int i=1;i<strs.size();i++){
                if(index>=strs[i].size()||strs[i][index]!=c)return str;
            }
            str+=c;
            index++;
        }
        
    }
};