-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path14.最长公共前缀.go
66 lines (62 loc) · 1.21 KB
/
14.最长公共前缀.go
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
import "sort"
/*
* @lc app=leetcode.cn id=14 lang=golang
*
* [14] 最长公共前缀
*
* https://leetcode-cn.com/problems/longest-common-prefix/description/
*
* algorithms
* Easy (33.29%)
* Likes: 550
* Dislikes: 0
* Total Accepted: 80.2K
* Total Submissions: 240.8K
* Testcase Example: '["flower","flow","flight"]'
*
* 编写一个函数来查找字符串数组中的最长公共前缀。
*
* 如果不存在公共前缀,返回空字符串 ""。
*
* 示例 1:
*
* 输入: ["flower","flow","flight"]
* 输出: "fl"
*
*
* 示例 2:
*
* 输入: ["dog","racecar","car"]
* 输出: ""
* 解释: 输入不存在公共前缀。
*
*
* 说明:
*
* 所有输入只包含小写字母 a-z 。
*
*/
func longestCommonPrefix(strs []string) string {
if len(strs) == 0 {
return ""
}
strings := Strings(strs)
sort.Sort(strings)
first := strings[0]
last := strings[len(strs)-1]
i := 0
for ; i < len(last) && i < len(first); i++ {
if last[i] != first[i] {
break
}
}
return string(last[:i])
}
type Strings []string
func (s Strings) Len() int { return len(s) }
func (s Strings) Swap(i, j int) {
s[i], s[j] = s[j], s[i]
}
func (s Strings) Less(i, j int) bool {
return s[i] < s[j]
}