1005.K次取反后最大化的数组和
题目链接:1005. K 次取反后最大化的数组和 - 力扣(LeetCode)
class Solution {
public int largestSumAfterKNegations(int[] nums, int k) {
Arrays.sort(nums);
int sum = 0;
for(int i = 0; i < nums.length && nums[i] < 0 && k != 0; ++i) {
--k;
nums[i] = -nums[i];
}
if(k % 2 == 0) {
for(int i = 0; i < nums.length; ++i) {
sum += nums[i];
}
return sum;
}else {
int min = nums[0];
for(int i = 0; i < nums.length; ++i) {
sum += nums[i];
min = nums[i] < min ? nums[i] : min;
}
return sum - (min << 1);
}
}
}
134. 加油站
class Solution {
public int canCompleteCircuit(int[] gas, int[] cost) {
if(gas.length == 1 && gas[0] == cost[0]) {
return 0;
}
for(int i = 0; i < gas.length; ++i) {
if(gas[i] - cost[i] <= 0) {
continue;
}
int cnt = 0;
int sum = 0;
int j = 0;
while(cnt < gas.length) {
j = (i + cnt) % gas.length;
sum += gas[j] - cost[j];
if(sum < 0) {
break;
}
++cnt;
}
if(cnt == gas.length) {
return i;
}else if(i < j){
i = j;
}else {
return -1;
}
}
return -1;
}
}
135. 分发糖果
class Solution {
public int candy(int[] ratings) {
int[] left = new int[ratings.length];
left[0] = 1;
for (int i = 1; i < left.length; ++i) {
if (ratings[i] > ratings[i - 1]) {
left[i] = left[i - 1] + 1;
} else {
left[i] = 1;
}
}
int right = 1;
int sum = left[left.length - 1];
for (int i = left.length - 2; i >= 0; --i) {
if (ratings[i] > ratings[i + 1]) {
right = right + 1;
} else {
right = 1;
}
sum += Math.max(left[i], right);
}
return sum;
}
}