14. Longest Common Prefix

题目

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

分析：

本题是求N个字符串的公共最长前缀，两两比较即可确定。

class Solution {
public:
    /**
    * 
    * @return: The longest common prefix
    */
    string longestCommonPrefix(vector<string> &strs) {
        // write your code here  
        if (strs.size() == 0)
            return "";
        string ret = strs[0];//以后每一次比较结果都存在这
        for (int i = 1; i<strs.size(); i++)
        {
            string cur = strs[i]; //存放1好字符串之后
            string temp = ret;      //用于比较的字符串
            ret = "";
            int length = (temp.length() <= cur.length() ? temp.length() : cur.length());//取比较的字符串的而最小值。

            for (int j = 0; j<length; j++)
            {
                if (temp[j] == cur[j])
                    ret += cur[j];
                else
                    break;
            }
        }
        return ret;
    }
};