algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-07 15:45:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 20201126贪心周末总结.md

Browse Source 
代码没有高亮显示
This commit is contained in:
sss1h
2024-02-05 16:31:15 +08:00
committed by GitHub
parent ad30291910
commit 3d90f1ed26
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/周总结/20201126贪心周末总结.md
View File

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