Feb 12, 2024 · Feb 2, 2024 · Feb 5, 2024 · Feb 5, 2024 · Feb 12, 2024
diff --git a/problems/0090.子集II.md b/problems/0090.子集II.md
diff --git a/problems/周总结/20201126贪心周末总结.md b/problems/周总结/20201126贪心周末总结.md
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
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