[LeetCode] Longest Common Prefix

class Solution {
public:
    string longestCommonPrefix(vector<string> &strs) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (strs.empty()) return "";
        
        for (int j = 0; j < strs[0].size(); j++) {
            for (int i = 0; i < strs.size(); i++) {
                if (j >= strs[i].size() || strs[i][j] != strs[0][j])
                    return strs[0].substr(0, j);
            }
        }
        
        return strs[0];
    }
};

Small Case: 4ms

Large Case: 24ms

Time: O(m * n)

Space: O(1)