Eric 的小站

1
输入：strs = ["flower","flow","flight"]
2
输出："fl"

1
输入：strs = ["dog","racecar","car"]
2
输出：""
3
解释：输入不存在公共前缀。

1
class Solution {
2
public:
3
    string longestCommonPrefix(vector<string>& strs) {
4
        for (int i = 0; i < strs[0].size(); i++) {
5
            char s = strs[0][i];
6
            for (int j = 1; j < strs.size() ; j++) {
7
                if (strs[j][i] != s || strs[j].size() == i) {
8
                    return strs[0].substr(0, i);
9
                }
10
            }
11
        }
12
        return strs[0];
13
    }
14
};