-
Notifications
You must be signed in to change notification settings - Fork 0
/
14.longest-common-prefix.cpp
69 lines (68 loc) · 1.48 KB
/
14.longest-common-prefix.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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
/*
* @lc app=leetcode id=14 lang=cpp
*
* [14] Longest Common Prefix
*
* https://leetcode.com/problems/longest-common-prefix/description/
*
* algorithms
* Easy (32.95%)
* Total Accepted: 437.5K
* Total Submissions: 1.3M
* Testcase Example: '["flower","flow","flight"]'
*
* 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.
*
*/
class Solution {
public:
string longestCommonPrefix(vector<string>& strs) {
string ans = "";
if (strs.empty()){
return ans;
}
int n = 0;
while(1){
if ((*strs.begin()).length() < n)
break;
char this_char = (*strs.begin())[n];
bool same_flag = true;
for (auto & element : strs) {
if (element.length() < n || element[n] != this_char)
{
same_flag = false;
break;
}
}
if (same_flag){
ans = ans + this_char;
n = n + 1;
}
else
break;
}
return ans;
}
};