Skip to content

[pull] master from youngyangyang04:master #420

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 4 commits into from
Feb 12, 2024
Merged

[pull] master from youngyangyang04:master #420

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
51481e1
Update 0090.子集II.md
liuhao230 Feb 2, 2024
ad30291
Merge branch 'youngyangyang04:master' into master
liuhao230 Feb 5, 2024
3d90f1e
Update 20201126贪心周末总结.md
liuhao230 Feb 5, 2024
8647c6a
Merge pull request #2434 from sss1h/master
youngyangyang04 Feb 12, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
7 changes: 0 additions & 7 deletions problems/0090.子集II.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -158,13 +158,6 @@ public:

其实这道题目的知识点，我们之前都讲过了，如果之前讲过的子集问题和去重问题都掌握的好，这道题目应该分分钟AC。

当然本题去重的逻辑，也可以这么写

```cpp
if (i > startIndex && nums[i] == nums[i - 1] ) {
continue;
}
```

## 其他语言版本

Expand Down
2 changes: 1 addition & 1 deletion problems/周总结/20201126贪心周末总结.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -69,7 +69,7 @@
代码很简单，但是思路却比较难。还需要反复琢磨。

针对[贪心算法：最大子序和](https://programmercarl.com/0053.最大子序和.html)文章中给出的贪心代码如下；
```
```cpp
class Solution {
public:
int maxSubArray(vector<int>& nums) {
Expand Down