negations专题

LeetCode1005. Maximize Sum Of Array After K Negations

文章目录 一、题目二、题解 一、题目 Given an integer array nums and an integer k, modify the array in the following way: choose an index i and replace nums[i] with -nums[i]. You should apply this process ex