mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-09 11:34:46 +08:00
添加 1005.K次取反后最大化的数组和.md Scala版本
This commit is contained in:
@ -289,6 +289,28 @@ function largestSumAfterKNegations(nums: number[], k: number): number {
|
|||||||
};
|
};
|
||||||
```
|
```
|
||||||
|
|
||||||
|
### Scala
|
||||||
|
|
||||||
|
```scala
|
||||||
|
object Solution {
|
||||||
|
def largestSumAfterKNegations(nums: Array[Int], k: Int): Int = {
|
||||||
|
var num = nums.sortWith(math.abs(_) > math.abs(_))
|
||||||
|
|
||||||
|
var kk = k // 因为k是不可变量,所以要赋值给一个可变量
|
||||||
|
for (i <- num.indices) {
|
||||||
|
if (num(i) < 0 && kk > 0) {
|
||||||
|
num(i) *= -1 // 取反
|
||||||
|
kk -= 1
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// kk对2取余,结果为0则为偶数不需要取反,结果为1为奇数,只需要对最后的数字进行反转就可以
|
||||||
|
if (kk % 2 == 1) num(num.size - 1) *= -1
|
||||||
|
|
||||||
|
num.sum // 最后返回数字的和
|
||||||
|
}
|
||||||
|
}
|
||||||
|
```
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
Reference in New Issue
Block a user