2019年8月19日
1004. Max Consecutive Ones III - Medium
摘要： Given an array A of 0s and 1s, we may change up to K values from 0 to 1. Return the length of the longest (contiguous) subarray that contains only 1s. 阅读全文
posted @ 2019-08-19 04:22 fatttcat 阅读(109) 评论(0) 推荐(0)