-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLongestCommonPrefix.java
More file actions
43 lines (31 loc) · 970 Bytes
/
LongestCommonPrefix.java
File metadata and controls
43 lines (31 loc) · 970 Bytes
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
/*14. Longest Common Prefix
leetcode link: https://leetcode.com/problems/longest-common-prefix/description/
Solved
Easy
Topics
Companies
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: strs = ["flower","flow","flight"]
Output: "fl"
Example 2:
Input: strs = ["dog","racecar","car"]
Output: ""
Explanation: There is no common prefix among the input strings.
Constraints:
1 <= strs.length <= 200
0 <= strs[i].length <= 200
strs[i] consists of only lowercase English letters.
*/
public class LongestCommonPrefix {
public String longestCommonPrefix(String[] strs) {
if (strs.length == 0)
return "";
for (int i = 0; i < strs[0].length(); i++)
for (int j = 1; j < strs.length; j++)
if (i == strs[j].length() || strs[j].charAt(i) != strs[0].charAt(i))
return strs[0].substring(0, i);
return strs[0];
}
}