1005、K次取反后最大化的数组和,暴力解法,java

This commit is contained in:
sharky
2023-04-18 15:15:28 +08:00
parent 29e1a07cc3
commit 9aaf02cc20

View File

@ -145,7 +145,23 @@ class Solution {
}
}
```
```java
//暴力解法
class Solution {
public int largestSumAfterKNegations(int[] nums, int k) {
int count = 0;
//循环k次
for( int i = 0; i < k; i++ ){
Arrays.sort( nums );
nums[0] = -nums[0];//把最小值换成其相反数
}
for ( int num : nums ){
count += num;//累加
}
return count;
}
}
```
### Python
```python
class Solution: