[LeetCode-Algorithms-14] "Longest Common Prefix" (2017.10.2-WEEK5)

题目链接：Longest Common Prefix

• 
  
• 题目描述：
  

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

---

(1)思路：这个题就是直接逐个字符比较，时间复杂度O(N*L)。

(2)代码：

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        int len = strs.size();
        if (len == 0) 
            return "";
        else if (len == 1) 
            return strs[0];
        string ans;
        for (int i = 0; i < strs[0].length(); i++) {
            for (int j = 1; j < len; j++) {
                if (strs[j - 1][i] != strs[j][i]) 
                    return ans;
            }
            ans += strs[0][i];
        }
        return ans;
    }
};

(3)提交结果：