store/works/solutions/leetcode/cpp/14.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35

#include <string>
#include <vector>

using std::string;
using std::vector;

class Solution
{
public:
    string longestCommonPrefix(vector<string> &strs)
    {
        if (strs.empty())
            return "";

        string result;

        const auto &first = strs.front();

        for (int i = 0; i < first.size(); i++)
        {
            char c = first[i];

            for (int j = 1; j < strs.size(); j++)
            {
                if (strs[j][i] != c)
                    goto r;
            }

            result.push_back(c);
        }

    r:
        return result;
    }
};