Commit e5c4e9e

committed

Update

1 parent 9d4c263 commit e5c4e9eCopy full SHA for e5c4e9e

File tree

+464

-115

lines changed

+464

-115

lines changed

Lines changed: 0 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -215,8 +215,6 @@ public:`
`215`	`215`
`216`	`216`	`所以不要轻视简单题,那种凭感觉就刷过去了,其实和没掌握区别不大,只有掌握方法论并说清一二三,才能触类旁通,举一反三哈!`
`217`	`217`
`218`		`-就酱,循序渐进学算法,认准「代码随想录」!`
`219`		`-`
`220`	`218`
`221`	`219`	`## 其他语言版本`
`222`	`220`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -38,7 +38,7 @@`
`38`	`38`
`39`	`39`	`题目中说要转换为一棵高度平衡二叉搜索树。为什么强调要平衡呢?`
`40`	`40`
`41`		`-因为只要给我们一个有序数组,如果强调平衡,都可以以线性结构来构造二叉搜索树。`
	`41`	`+因为只要给我们一个有序数组,如果不强调平衡,都可以以线性结构来构造二叉搜索树。`
`42`	`42`
`43`	`43`	`例如有序数组[-10,-3,0,5,9] 就可以构造成这样的二叉搜索树,如图。`
`44`	`44`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -100,7 +100,7 @@ public:`
`100`	`100`
`101`	`101`	`窗口就是满足其和 ≥ s 的长度最小的连续子数组。`
`102`	`102`
`103`		`-窗口的起始位置如何移动:如果当前窗口的值大于s了,窗口就要向前移动了(也就是该缩小了)。`
	`103`	`+窗口的起始位置如何移动:如果当前窗口的值大于等于s了,窗口就要向前移动了(也就是该缩小了)。`
`104`	`104`
`105`	`105`	`窗口的结束位置如何移动:窗口的结束位置就是遍历数组的指针,也就是for循环里的索引。`
`106`	`106`

Comments

(0)