LeetCode: Longest Common Prefix

思路：找出最短长度，依次搜索各个字符串，遇到不同的字符截止。

class Solution {
public:
    string longestCommonPrefix(vector<string> &strs) {
        if(strs.size()>0){
            int len = strs[0].length();
            for(int i=1;i<strs.size();i++){
				int len2 = strs[i].length();
                len = min(len,len2);
			}
            string ret;
            for(int i=0;i<len;i++){
                char temp = strs[0][i];
                for(int j=1;j<strs.size();j++)
                    if(strs[j][i] != temp)return ret;
                ret += temp;
            }
            return ret;
        }
        return "";
    }
};