[LeetCode] Longest Common Prefix

Write a function to find the longest common prefix string amongst an array of strings.

模拟法，先选取第一个字符串，之后依次和后面的字符串得出LCP

class Solution {
public:
    string longestCommonPrefix(vector<string> &strs) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (strs.size() == 0)
            return "";
            
        string s = strs[0];
        
        for(int i = 1; i < strs.size(); i++)
        {
            int j = 0;
            
            int len = min(strs[i].size(), s.size());
            
            while(j < len)
            {
                if (strs[i][j] != s[j])
                    break;
                j++;
            }
            
            s.erase(j, s.size());
        }
        
        return s;
    }
};