From 3d90f1ed267ebc68f523c8221677115f74aa8912 Mon Sep 17 00:00:00 2001 From: sss1h <49825610+sss1h@users.noreply.github.com> Date: Mon, 5 Feb 2024 16:31:15 +0800 Subject: [PATCH] =?UTF-8?q?Update=2020201126=E8=B4=AA=E5=BF=83=E5=91=A8?= =?UTF-8?q?=E6=9C=AB=E6=80=BB=E7=BB=93.md?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit 代码没有高亮显示 --- problems/周总结/20201126贪心周末总结.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/problems/周总结/20201126贪心周末总结.md b/problems/周总结/20201126贪心周末总结.md index cdfe4a96..3494a320 100644 --- a/problems/周总结/20201126贪心周末总结.md +++ b/problems/周总结/20201126贪心周末总结.md @@ -69,7 +69,7 @@ 代码很简单,但是思路却比较难。还需要反复琢磨。 针对[贪心算法:最大子序和](https://programmercarl.com/0053.最大子序和.html)文章中给出的贪心代码如下; -``` +```cpp class Solution { public: int maxSubArray(vector& nums) {