go language study notes 2

Learn language with algorithms,

Go variable definitions can be

var s1 strings1 := "521"

Import and output need import "fmt"

fmt.Println("hello world")//Outputfmt.Scanf("%s%s", &s1, &s2)//input

The function uses func to define the parameter in front of the variable name, followed by the type, and the return value type is defined in front of the curly brackets

func test(s1 string, s2 string) int{return 1}

To get the length of the string, use strings.Count(str,"") to get it. The length should be reduced by one.

There is no char type in the go language, only the byte type, so a single character is of the byte type,

The array in the go language needs to initialize the length and cannot use variables, such as

var dp [10000][10000]int

That's all the language knowledge needed for the first algorithm problem,

Title: Given a string str and a string T, return the number of all substrings of str that contain all of T

Code

package mainimport ("fmt""math""strings")func main() {fmt.Println("hello world")var s1 stringvar s2 stringfmt.Scanf("%s%s", &s1, &s2)var ans int = findTsubString(s1, s2)fmt.Println("ans=", ans)//Findmain()strAns := getUniqueSubString("1232")fmt.Printf("strAns=%d", strAns)}func findTsubString(S string, T string) int {if strings.Count(S, "") < strings.Count(T, "") {return 0}N := strings.Count(S, "") - 1M := strings.Count(T, "") - 1var dp[10000][10000]intif S[0] == T[0] {dp[0][0] = 1}for index := 1; index < N; index++ {if S[index] == T[0] {dp[index][0] = dp[index-1][0] + 1} else {dp[index][0] = dp[index-1][0]}}for i := 1; i < N; i++ {for j := 1; j <= int(math.Min(float64(i), float64(M-1))); j++ {dp[i][j] = dp[i-1][j]if S[i] == T[j] {dp[i][j] += dp[i-1][j-1]}}}return dp[N-1][M-1]}