14. Longest Common Prefix

https://leetcode.com/problems/longest-common-prefix/

Problem

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

If there is no common prefix, return an empty string "".

Example 1:

Input: ["flower","flow","flight"]
Output: "fl"

Example 2:

Input: ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.

Note:

All given inputs are in lowercase letters a-z.

Solution

class Solution {
public:
    string longestCommonPrefix(vector<string>& strs) {
        if (strs.empty()) return "";
        string prefix = strs[0];
        for (int i = 1; i < strs.size(); ++i) {
            const int size = min(prefix.size(), strs[i].size());
            string temp;
            for (int j = 0; j < size; ++j) {
                if (prefix[j] == strs[i][j]) temp += prefix[j];
                else break;
            }
            prefix = temp;
        }
        return prefix;
    }
};

• #string

• #important