Longest Common Prefix

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        string result = "";
        if(strs.empty())
            return result;
        for(int i = 0; i < strs[0].size(); i++)
        {
            for(int j = 1; j < strs.size(); j++)
            {
                if(strs[j - 1][i] != strs[j][i])
                    return result;
            }
            result += strs[0][i];
        }
        return result;
    }
};