Merge pull request #1711 from L1Y1/master

Update 1005.K次取反后最大化的数组和.md (js版本)
This commit is contained in:
程序员Carl
2022-11-06 15:07:36 +08:00
committed by GitHub

View File

@ -190,23 +190,23 @@ func largestSumAfterKNegations(nums []int, K int) int {
### Javascript ### Javascript
```Javascript ```Javascript
var largestSumAfterKNegations = function(nums, k) { var largestSumAfterKNegations = function(nums, k) {
nums.sort((a, b) => {
return Math.abs(b) - Math.abs(a) nums.sort((a,b) => Math.abs(b) - Math.abs(a))
})
for(let i = 0 ;i < nums.length; i++){ for(let i = 0 ;i < nums.length; i++){
if(nums[i] < 0 && k > 0){ if(nums[i] < 0 && k > 0){
nums[i] *= -1 nums[i] = - nums[i];
k-- k--;
} }
} }
if(k > 0 && k % 2 === 1) { // 若k还大于0,则寻找最小的数进行不断取反
nums[nums.length - 1] *= -1 while( k > 0 ){
nums[nums.length-1] = - nums[nums.length-1]
k--;
} }
k = 0
return nums.reduce((a, b) => { return nums.reduce((a, b) => {
return a + b a + b
}) })
}; };