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.

Note:

All given inputs are in lowercase letters a-z.

---

S解题思路：找到多个字符串中最长共同的子字符串。

注意：1、串为零 2、共同位置的共同的子字符串

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        if(strs.size()==0)return "";
        string res="";
        string prefix=strs[0];
        for(int i = 1; i < strs.size(); ++i){
            for(int c = 0; c < prefix.size(); ++c){
                if(strs[i][c] != prefix[c]){
                    prefix = prefix.substr(0,c);
                    break;
                }
            }
        }
        return prefix;
    }
};