mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-10 04:06:51 +08:00
添加 1005.K次取反后最大化的数组和.md C版本
This commit is contained in:
@ -211,5 +211,44 @@ var largestSumAfterKNegations = function(nums, k) {
|
||||
};
|
||||
```
|
||||
|
||||
### C
|
||||
```c
|
||||
#define abs(a) (((a) > 0) ? (a) : (-(a)))
|
||||
|
||||
// 对数组求和
|
||||
int sum(int *nums, int numsSize) {
|
||||
int sum = 0;
|
||||
|
||||
int i;
|
||||
for(i = 0; i < numsSize; ++i) {
|
||||
sum += nums[i];
|
||||
}
|
||||
return sum;
|
||||
}
|
||||
|
||||
int cmp(const void* v1, const void* v2) {
|
||||
return abs(*(int*)v2) - abs(*(int*)v1);
|
||||
}
|
||||
|
||||
int largestSumAfterKNegations(int* nums, int numsSize, int k){
|
||||
qsort(nums, numsSize, sizeof(int), cmp);
|
||||
|
||||
int i;
|
||||
for(i = 0; i < numsSize; ++i) {
|
||||
// 遍历数组,若当前元素<0则将当前元素转变,k--
|
||||
if(nums[i] < 0 && k > 0) {
|
||||
nums[i] *= -1;
|
||||
--k;
|
||||
}
|
||||
}
|
||||
|
||||
// 若遍历完数组后k还有剩余(此时所有元素应均为正),则将绝对值最小的元素nums[numsSize - 1]变为负
|
||||
if(k % 2 == 1)
|
||||
nums[numsSize - 1] *= -1;
|
||||
|
||||
return sum(nums, numsSize);
|
||||
}
|
||||
```
|
||||
|
||||
-----------------------
|
||||
<div align="center"><img src=https://code-thinking.cdn.bcebos.com/pics/01二维码一.jpg width=500> </img></div>
|
||||
|
Reference in New Issue
Block a user