【JAVA、C++】LeetCode 014 Longest Common Prefix

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

解题思路：

老实遍历即可，注意边界条件：

JAVA实现：

	static public String longestCommonPrefix(String[] strs) {
        if (strs.length == 0)
            return "";
        for (int i = 0; i < strs[0].length(); i++) {
            for (int j = 1; j < strs.length; j++)
                if (strs[j].length() == i || strs[j].charAt(i) != strs[0].charAt(i))
                    return strs[0].substring(0, i);
        }
        return strs[0];
    }

C++：

 class Solution {
 public:
     string longestCommonPrefix(vector<string>& strs) {
         if (strs.size() == )
             return "";
         for (int i = ; i < strs[].length(); i++) {
             for (int j = ; j < strs.size(); j++)
                 if (strs[j].length() == i || strs[j][i] != strs[][i])
                     return strs[].substr(, i);
         }
         return strs[];
     }
 };