Leetcode 14 - Longest Common Prefix

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

只需要将每个字符串逐一和第一个字符串（即strs[0]）比较，一旦发现不相同的则停止比较。

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