【LeetCode】014. Longest Common Prefix

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

 

题解：

　　简单的暴力遍历解决

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        int n = strs.size();
        if (n < 1 || strs[0].empty())
            return "";
        string res;
        
        for (int j = 0; j < strs[0].size(); ++j) {
            char c = strs[0][j];
            for (int i = 1; i < strs.size(); ++i) {
                if (j >= strs[i].size() || strs[i][j] != c)
                    return res;
            }
            
            res += c;
        }
        
        return res;
    }
};