wisdompeak / LeetCode

This repository contains the solutions and explanations to the algorithm problems on LeetCode. Only medium or above are included. All are written in C++/Python and implemented by myself. The problems attempted multiple times are labelled with hyperlinks.

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

双指针解法疑问

bobosolomon opened this issue · comments

在双指针解法中,应该考虑的是 A[i] == 0A[i] == 1 的情况,而不是考虑 A[i+1]的取值?

哥你好歹給個題號吧

不好意思,第一次提issue, 题号是1004.Max-Consecutive-Ones-III

原来的文字逻辑没表述清楚,已更新。