leetcode-14-Longest Common Prefix

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        if(strs.empty()) return "";//注意特殊情况的判断
        string ans=strs[0];
        for(int i=1;i<strs.size();i++){
            string temp=strs[i];
            for(int j=0;j<ans.size();j++){
                if(temp[j]==ans[j]) continue;
                else ans=j==0?"":ans.substr(0,j);
            }
        }
        return ans;
    }
};

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.

Note:

All given inputs are in lowercase letters a-z.

题目比较简单。