14最长公共前缀

我是用两重循环直接做的，题解里提到了可以用分治法，依次求几个string两两间的最长公共前缀

#include<iostream>
#include<string>
#include<vector>
using namespace std;
class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        int m = strs.size();
        int index = 0;
        int minlen = INT_MAX;
        for (int i = 0; i < m; i++) {
            if (strs[i].size() < minlen) {
                minlen = strs[i].size();
            }
        }
        int flag = 1;
        for (int i = 0; i < minlen && flag==1; i++) {
            for (int j = 0; j < m-1 ; j++) {
                if (strs[j][i] != strs[j+1][i]) {
                    flag = 0;
                    break;
                }
            }
            if (flag == 0) {
                break;
            }
            index++;
        }
        if (index == 0) {
            return "";
        }
        return strs[0].substr(0, index);
    }
};
int main() {
    Solution test;
    vector<string>str = { "fdower","flow","flight" };
    cout << test.longestCommonPrefix(str);
}