-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path14.最长公共前缀.java
67 lines (67 loc) · 1.54 KB
/
14.最长公共前缀.java
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
/*
* @lc app=leetcode.cn id=14 lang=java
*
* [14] 最长公共前缀
*
* https://leetcode-cn.com/problems/longest-common-prefix/description/
*
* algorithms
* Easy (33.60%)
* Likes: 582
* Dislikes: 0
* Total Accepted: 87.5K
* Total Submissions: 259.6K
* Testcase Example: '["flower","flow","flight"]'
*
* 编写一个函数来查找字符串数组中的最长公共前缀。
*
* 如果不存在公共前缀,返回空字符串 ""。
*
* 示例 1:
*
* 输入: ["flower","flow","flight"]
* 输出: "fl"
*
*
* 示例 2:
*
* 输入: ["dog","racecar","car"]
* 输出: ""
* 解释: 输入不存在公共前缀。
*
*
* 说明:
*
* 所有输入只包含小写字母 a-z 。
*
*/
class Solution {
public String longestCommonPrefix(String[] strs) {
if (strs.length == 0) {
return "";
}
int len = 0;
char cur = 0;
boolean finish = false;
while (!finish) {
for (int i = 0; i < strs.length; i++) {
String str = strs[i];
if (str.length() <= len) {
finish = true;
break;
}
if (cur == 0) {
cur = str.charAt(len);
} else if (str.charAt(len) != cur) {
finish = true;
break;
}
if (i == strs.length - 1) {
cur = 0;
len++;
}
}
}
return strs[0].substring(0, len);
}
}