ehlxr/algorithm-base
1
0
Fork 0
mirror of https://github.com/chefyuan/algorithm-base.git synced 2024-11-28 14:58:55 +00:00
Code Issues Projects Releases Wiki Activity

Update leetcode560和为K的子数组.md

Browse Source
This commit is contained in:
MoriSummer 2021-04-27 15:13:00 +08:00 committed by GitHub
parent 8ef63207ac
commit 376bec88ef
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
animation-simulation/前缀和/leetcode560和为K的子数组.md
View File

@ -164,7 +164,7 @@ public:
//细节，这里需要预存前缀和为 0 的情况，会漏掉前几位就满足的情况 //细节，这里需要预存前缀和为 0 的情况，会漏掉前几位就满足的情况
//例如输入[1,1,0]，k = 2 如果没有这行代码，则会返回0,漏掉了1+1=2，和1+1+0=2的情况 //例如输入[1,1,0]，k = 2 如果没有这行代码，则会返回0,漏掉了1+1=2，和1+1+0=2的情况
//输入：[3,1,1,0] k = 2时则不会漏掉 //输入：[3,1,1,0] k = 2时则不会漏掉
//因为presum[3] - presum[0]表示前面 3 位的和，所以需要map.put(0,1),垫下底 //因为presum[3] - presum[0]表示前面 3 位的和，所以需要m.insert({0,1}),垫下底
m.insert({0, 1}); m.insert({0, 1});
int count = 0; int count = 0;
int presum = 0; int presum = 0;