Leetcode14最长公共前缀

Longest Common Prefix
Write a function to find the longest common prefix string amongst an array of strings.
If there is no common prefix, return an empty string “”.
Example 1:
Input: [“flower”,“flow”,“flight”]
Output: “fl”
Example 2:
Input: [“dog”,“racecar”,“car”]
Output: “”
Explanation: There is no common prefix among the input strings.

prefix=prefix.substr(0,prefix.size()-1);
strs[i].find(prefix)!=0

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        int size=strs.size();
        if(size==0){
            return "";//strs无字符串，则为空
        }
        string prefix=strs[0];//假设第一个字符串为公共前缀
        for(int i=1;i<size;i++){//判断每一个字符串中是否含有prefix，
            while(strs[i].find(prefix)!=0){//如果不含有prefix，则将prefix
  //长度减1，再次判断prefix-1是否为其子串（==0表示含有该字串），直到prefix为空，
                prefix=prefix.substr(0,prefix.size()-1);//如果prefix为空串，
            // 则说明公共前缀为空
                if(prefix.size()==0){
                    return "";
                }

            }
        }
        return prefix;
        
    }
};