2019年4月29日
[LeetCode] 995. Minimum Number of K Consecutive Bit Flips 连续K位翻转的最小次数
摘要： In an array A containing only 0s and 1s, a *K-bit flip *consists of choosing a (contiguous) subarray of length K and simultaneously changing every 0 i 阅读全文
posted @ 2019-04-29 23:48 Grandyang 阅读(2155) 评论(7) 推荐(0) 编辑
Fork me on GitHub