Longest Common Prefix

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

 

Analyse: 找一些序列的最长前缀子序列。

 

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