当前位置：网站首页>Self study golang [3.8 use go language to find the longest substring without repeated characters] exercise code

Self study golang [3.8 use go language to find the longest substring without repeated characters] exercise code

2022-07-22 08:35:00 【Aspire to be a doctor】

Code section ：

package main

import "fmt"

// Find the longest substring that does not contain duplicate characters 
// for example ：abcabcbb：abc
//bbbbb:b
func length(s string) int { // Define a function , Parameter type is string, The return value of the function is int
	last := make(map[rune]int)
	start := 0
	maxlength := 0
	for i, ch := range []rune(s) { //[]rune Yes, it will s To rune type 
		if last, ok := last[ch]; ok && last >= start { // prevent last non-existent 
			start = last + 1
		}
		if i-start+1 > maxlength {
			maxlength = i - start + 1
		}
		last[ch] = i
	}
	return maxlength
}
func main() {
	fmt.Println(length("abcabcbb"))
	fmt.Println(length("bbbbb"))
	fmt.Println(length(" I'm Li Wenjie "))
}