golang_算法: leetcode_字符串09-最长公共前缀

方法: 利用strings.Index函数,拿第一个字符串与之后的字符串分别进行比较

func Index(s, sep string) int

子串sep在字符串s中第一次出现的位置，不存在则返回-1。

package main

import (
"fmt"
"strings"
)

//strings函数查看是否包含
func longestCommonPrefix(strs []string) string {
if len(strs) == 0 {
return ""
}
fs := strs[0] //数组第一个字符串
fmt.Println("fs =",fs)

for i:=1; i<len(strs); i++ {
fmt.Printf("i = %d\n",i)
for strings.Index(strs[i], fs) != 0 {
fmt.Println("strings.Index ",strings.Index(strs[i], fs))
fs = fs[0:len(fs) - 1]
fmt.Println("strings.Index2 ",strings.Index(strs[i], fs))
fmt.Println("fs2 =",fs)
}
}
if len(fs) > 0 {
return fs
}

return ""
}

func main() {
s := []string{"flower","flow","flight"}
longestCommonPrefix(s)
}

Output:

fs = flower
i = 1
strings.Index  -1
strings.Index2  -1
fs2 = flowe
strings.Index  -1
strings.Index2  0
fs2 = flow
i = 2
strings.Index  -1
strings.Index2  -1
fs2 = flo
strings.Index  -1
strings.Index2  0
fs2 = fl