algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-07 01:44:56 +08:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #217 from brenobaptista/update-14

Browse Source 
Update problem #14
This commit is contained in:
halfrost
2021-12-22 21:26:23 -08:00
committed by GitHub
parent 0468622cc6 24a8bbfa66
commit 90ee2871be
3 changed files with 24 additions and 33 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
leetcode/0014.Longest-Common-Prefix/14.Longest Common Prefix.go
View File

@ -1,23 +1,16 @@
package leetcode
import "sort"
func longestCommonPrefix(strs []string) string {
sort.Slice(strs, func(i, j int) bool {
return len(strs[i]) <= len(strs[j])
})
minLen := len(strs[0])
if minLen == 0 {
return ""
}
var commonPrefix []byte
for i := 0; i < minLen; i++ {
for j := 1; j < len(strs); j++ {
if strs[j][i] != strs[0][i] {
return string(commonPrefix)
prefix := strs[0]
for i := 1; i < len(strs); i++ {
for j := 0; j < len(prefix); j++ {
if len(strs[i]) <= j || strs[i][j] != prefix[j] {
prefix = prefix[0:j]
break
}
}
commonPrefix = append(commonPrefix, strs[0][i])
}
return string(commonPrefix)
return prefix
}

5
leetcode/0014.Longest-Common-Prefix/14.Longest Common Prefix_test.go
View File

@ -33,6 +33,11 @@ func Test_Problem14(t *testing.T) {
para14{[]string{"dog", "racecar", "car"}},
ans14{""},
},
{
para14{[]string{"ab", "a"}},
ans14{"a"},
},
}
fmt.Printf("------------------------Leetcode Problem 14------------------------\n")

25
leetcode/0014.Longest-Common-Prefix/README.md
View File

@ -40,25 +40,18 @@ If there is no common prefix, return an empty string "".
package leetcode
import "sort"
func longestCommonPrefix(strs []string) string {
sort.Slice(strs, func(i, j int) bool {
return len(strs[i]) <= len(strs[j])
})
minLen := len(strs[0])
if minLen == 0 {
return ""
}
var commonPrefix []byte
for i := 0; i < minLen; i++ {
for j := 1; j < len(strs); j++ {
if strs[j][i] != strs[0][i] {
return string(commonPrefix)
prefix := strs[0]
for i := 1; i < len(strs); i++ {
for j := 0; j < len(prefix); j++ {
if len(strs[i]) <= j || strs[i][j] != prefix[j] {
prefix = prefix[0:j]
break
}
}
commonPrefix = append(commonPrefix, strs[0][i])
}
return string(commonPrefix)
return prefix
}
```