leetcode 14. 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.

最长公共前缀问题。很简单的写法是按列依次进行扫描。

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        int sz=strs.size();
        if(sz==0)return string("");
        if(sz==1)return strs[0];
        int len=strs[0].length();
        bool flag=false;
        int i;
        for(i=0;i<len;i++){
            for(int j=1;j<sz;j++)
                if(i>=strs[j].length()||strs[0][i]!=strs[j][i]){
                    flag=true;
                    break;
                }
            if(flag)break;
        }
        return strs[0].substr(0,i);
    }
};