10 - Longest Common Prefix

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

solution: 从字符串的第一个字母开始往后比较直至出现不同。

class Solution {
public:
    bool compareAllChar(vector<string> &strs, int index)
    {
        for(int i = 0; i < strs.size(); i++)
        {
            if(index >= strs[i].length())
                return false;
            
            if(strs[0].at(index) != strs[i].at(index))
                return false;
        }
        
        return true; 
    }

    string longestCommonPrefix(vector<string> &strs) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if(strs.size() == 0)
            return "";
        
        int start = 0;
        string res = "";
        for(start;start < strs[0].length(); start++)
        {
            bool isPrefix = compareAllChar(strs, start);
            if(!isPrefix)
                break;
            res = res + strs[0].at(start);
        }
        
        return res;
    }
};