0014.cpp

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        if (strs.size() == 0) return "";
        if (strs.size() == 1) return strs[0];

        string ans;
        int minLen = strs[0].length();

        for (int i = 1; i < strs.size(); i++)
            minLen = min(minLen, (int)strs[i].length());

        bool isMatch = true;

        for (int i = 0; i < minLen; i++) {
            char c = strs[0][i];
            for (int j = 1; j < strs.size(); j++)
                if (c != strs[j][i]) {
                    isMatch = false;
                    break;
                }
            if (!isMatch) break;
            ans += c;
        }

        return ans;
    }
};