Commit 8647c6a

authored

Merge pull request youngyangyang04#2434 from sss1h/master

Update 0090.子集II.md

2 parents fca3e47 + 3d90f1e commit 8647c6aCopy full SHA for 8647c6a

File tree

-8

lines changed

-8

lines changed

Lines changed: 0 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -158,13 +158,6 @@ public:`
`158`	`158`
`159`	`159`	`其实这道题目的知识点,我们之前都讲过了,如果之前讲过的子集问题和去重问题都掌握的好,这道题目应该分分钟AC。`
`160`	`160`
`161`		`-当然本题去重的逻辑,也可以这么写`
`162`		`-`
`163`		-```cpp
`164`		`-if (i > startIndex && nums[i] == nums[i - 1] ) {`
`165`		`- continue;`
`166`		`-}`
`167`		-```
`168`	`161`
`169`	`162`	`## 其他语言版本`
`170`	`163`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -69,7 +69,7 @@`
`69`	`69`	`代码很简单,但是思路却比较难。还需要反复琢磨。`
`70`	`70`
`71`	`71`	`针对[贪心算法:最大子序和](https://programmercarl.com/0053.最大子序和.html)文章中给出的贪心代码如下;`
`72`		-```
	`72`	+```cpp
`73`	`73`	`class Solution {`
`74`	`74`	`public:`
`75`	`75`	`int maxSubArray(vector<int>& nums) {`

Comments

(0)