LeetCode 14. Longest Common Prefix

Write a function to find the longest common prefix string amongst an array of strings.

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

class Solution {

public:

string longestCommonPrefix(vector<string>& strs) {

if(strs.size() == 0)

return "";

string s = strs[0];

for(int i = 1; i < strs.size(); i++) {

for(int j = 0; j < s.length(); j++) {

if(s[j] != strs[i][j]) {

s = s.substr(0, j);

break;

}

return s;

}

};

❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼

❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼

❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版