若水之畔

摘要： 题目 Given an array A of integers, we must modify the array in the following way: we choose an i and replace A[i] with A[i], and we repeat this process 阅读全文

摘要： 将自己再LeetCode刷题上的结果做一个汇总 Easy "2.Two Sum" "1005. Maximize Sum Of Array After K Negations" 阅读全文