LeetCode --- 1005. Maximize Sum Of Array After K Negations 解题报告

Posted 杨鑫newlfe

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode --- 1005. 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 exactly k times. You may choose the same index i multiple times.

Return the largest possible sum of the array after modifying it in this way.

Example 1:

Input: nums = [4,2,3], k = 1
Output: 5
Explanation: Choose index 1 and nums becomes [4,-2,3].

Example 2:

Input: nums = [3,-1,0,2], k = 3
Output: 6
Explanation: Choose indices (1, 2, 2) and nums becomes [3,1,0,2].

Example 3:

Input: nums = [2,-3,-1,5,-4], k = 2
Output:

以上是关于LeetCode --- 1005. Maximize Sum Of Array After K Negations 解题报告的主要内容,如果未能解决你的问题,请参考以下文章

leetcode每日一题:1005. K 次取反后最大化的数组和

LeetCode --- 1005. Maximize Sum Of Array After K Negations 解题报告

LeetCode --- 1005. Maximize Sum Of Array After K Negations 解题报告

LeetCode 1005[贪心] K次取反后最大化的数组和 HERODING的LeetCode之路

LeetCode 1005.K 次取反后最大化的数组和

Leetcode刷题100天—1005. K 次取反后最大化的数组和( 数组)—day78