LeetCode – Refresh – Longest Common Prefix

Seach one by one.

class Solution {
public:
    string getNext(const string& s1, const string& s2) {
        int len = min(s1.size(), s2.size()), i = 0;
        for (; i < len; i++) {
            if (s1[i] != s2[i]) {
                break;
            }
        }
        return s1.substr(0, i);
    }
    string longestCommonPrefix(vector<string> &strs) {
        int len = strs.size();
        if (len == 0) return "";
        string result = strs[0];
        for (int i = 1; i < len; i++) {
            result = getNext(result, strs[i]);
        }
        return result;
    }
};