1. 程式人生 > >19.1.26 [LeetCode14] Longest Common Prefix

19.1.26 [LeetCode14] Longest Common Prefix

click color 註意 strings return cto 9.1 close span

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.
技術分享圖片
 1 class Solution {
 2 public:
 3     string longestCommonPrefix(vector<string>& strs) {
 4         if (strs.size() == 0)return "";
 5         int ans = 0, l = strs[0].length();
 6         for (int i =0; i < l; i++) {
 7             char c = strs[0][i];
 8             for (int j = 1
; j < strs.size(); j++) 9 if (strs[j][i] != c) 10 return strs[0].substr(0,ans); 11 ans++; 12 } 13 return strs[0].substr(0, ans); 14 } 15 };
View Code

唯一需要註意的地方是數組可能為空

19.1.26 [LeetCode14] Longest Common Prefix