2021年1月18日
[LeetCode] 1005. Maximize Sum Of Array After K Negations K次取反后最大化的数组和
摘要： Given an array of integers, we must modify the array in the following way: we choose an and replace with , and we repeat this process times in total. 阅读全文
posted @ 2021-01-18 08:31 Grandyang 阅读(1050) 评论(0) 推荐(0)
[LeetCode] 1004. Max Consecutive Ones III 最大连续1的个数之三
摘要： Given an array of 0s and 1s, we may change up to values from 0 to 1. Return the length of the longest (contiguous) subarray that contains only 1s. Exa 阅读全文
posted @ 2021-01-18 06:08 Grandyang 阅读(2380) 评论(0) 推荐(1)
Fork me on GitHub