mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-08 00:43:04 +08:00
Update 20201126贪心周末总结.md
代码没有高亮显示
This commit is contained in:
@ -69,7 +69,7 @@
|
||||
代码很简单,但是思路却比较难。还需要反复琢磨。
|
||||
|
||||
针对[贪心算法:最大子序和](https://programmercarl.com/0053.最大子序和.html)文章中给出的贪心代码如下;
|
||||
```
|
||||
```cpp
|
||||
class Solution {
|
||||
public:
|
||||
int maxSubArray(vector<int>& nums) {
|
||||
|
Reference in New Issue
Block a user