Title

the problem link

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

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