Skip to content

Commit 435c10b

mario-huang mario-huang

authored

minimum-window-substring (labuladong#1593)

1 parent fc4b58b commit 435c10bCopy full SHA for 435c10b

File tree

1 file changed

+35

-24

lines changed

多语言解法代码
- solution_code.md

1 file changed

+35

-24

lines changed

`‎多语言解法代码/solution_code.md`

Lines changed: 35 additions & 24 deletions

Original file line number	Diff line number	Diff line change
`@@ -42621,53 +42621,64 @@ class Solution {`
`42621`	`42621`	```
`42622`	`42622`
`42623`	`42623`	```go
`42624`		`-// by chatGPT (go)`
`42625`		`-// 采用滑动窗口方法的 Go 解法`
	`42624`	`+// by mario_huang (go)`
`42626`	`42625`	`func minWindow(s string, t string) string {`
`42627`		`- // 将需要匹配的字符及其出现次数存入 need`
`42628`		`- // 将滑动窗口中的字符及出现次数存入 window`
`42629`		`- need, window := make(map[byte]int), make(map[byte]int)`
`42630`		`- for i := range t {`
`42631`		`- need[t[i]]++`
	`42626`	`+ need := map[byte]int{}`
	`42627`	`+ window := map[byte]int{}`
	`42628`	`+ for _, c := range []byte(t) {`
	`42629`	`+ need[c]++`
`42632`	`42630`	`}`
`42633`		`-`
`42634`		`- left, right := 0, 0 // 定义窗口的左右边界`
`42635`		`- valid := 0 // valid 存储满足 need 条件的字符个数`
`42636`		`- start, length := 0, math.MaxInt32 // 定义最小覆盖子串的起始位置及长度`
`42637`		`-`
`42638`		`- for right < len(s) { // 当右边界小于 s 的长度时`
	`42631`	`+ left, right := 0, 0`
	`42632`	`+ valid := 0`
	`42633`	`+ // 记录最小覆盖子串的起始索引及长度`
	`42634`	`+ start, length := 0, math.MaxInt`
	`42635`	`+ /**<extend down -200>`
	`42636`	`+ ![](../pictures/slidingwindow/1.png)`
	`42637`	`+ */`
	`42638`	`+ for right < len(s) {`
	`42639`	`+ // c 是将移入窗口的字符`
`42639`	`42640`	`c := s[right]`
	`42641`	`+ // 右移窗口`
`42640`	`42642`	`right++`
`42641`		`-`
`42642`		`- if _, ok := need[c]; ok { // 如果 c 是需要匹配的字符`
	`42643`	`+ // 进行窗口内数据的一系列更新`
	`42644`	`+ if _, ok := need[c]; ok {`
`42643`	`42645`	`window[c]++`
`42644`	`42646`	`if window[c] == need[c] {`
`42645`	`42647`	`valid++`
`42646`	`42648`	`}`
`42647`	`42649`	`}`
`42648`		`-`
`42649`		`- for valid == len(need) { // 当窗口中已经包含了所有需要的字符时`
`42650`		`- if right-left < length { // 更新最小覆盖子串长度及起始位置`
	`42650`	`+ // 判断左侧窗口是否要收缩`
	`42651`	`+ for valid == len(need) {`
	`42652`	`+ /**<extend down -200>`
	`42653`	`+ ![](../pictures/slidingwindow/2.png)`
	`42654`	`+ */`
	`42655`	`+ // 在这里更新最小覆盖子串`
	`42656`	`+ if right-left < length {`
`42651`	`42657`	`start = left`
`42652`	`42658`	`length = right - left`
`42653`	`42659`	`}`
	`42660`	`+ // d 是将移出窗口的字符`
`42654`	`42661`	`d := s[left]`
	`42662`	`+ // 左移窗口`
`42655`	`42663`	`left++`
`42656`		`-`
`42657`		`- if _, ok := need[d]; ok { // 如果 d 是需要匹配的字符`
	`42664`	`+ // 进行窗口内数据的一系列更新`
	`42665`	`+ if _, ok := need[d]; ok {`
`42658`	`42666`	`if window[d] == need[d] {`
`42659`	`42667`	`valid--`
`42660`	`42668`	`}`
`42661`	`42669`	`window[d]--`
`42662`	`42670`	`}`
`42663`	`42671`	`}`
	`42672`	`+ /**<extend up -50>`
	`42673`	`+ ![](../pictures/slidingwindow/4.png)`
	`42674`	`+ */`
`42664`	`42675`	`}`
`42665`		`-`
`42666`		`- if length == math.MaxInt32 { // 如果没有符合要求的子串,返回空字符串`
	`42676`	`+ // 返回最小覆盖子串`
	`42677`	`+ if length == math.MaxInt {`
`42667`	`42678`	`return ""`
	`42679`	`+ } else {`
	`42680`	`+ return s[start : start+length]`
`42668`	`42681`	`}`
`42669`		`-`
`42670`		`- return s[start : start+length] // 返回最小覆盖子串`
`42671`	`42682`	`}`
`42672`	`42683`	```
`42673`	`42684`

0 commit comments

Comments

(0)