1005.K次取反后最大化的数组和
class Solution {
public:
int largestSumAfterKNegations(vector<int>& nums, int k) {
for(int i = 0; i<k; i++){
sort(nums.begin(), nums.end());
nums[0] = -nums[0];
}
int result = 0;
for(int i=0; i<nums.size(); i++){
result+=nums[i];
}
return result;
}
};
134. 加油站
class Solution {
public:
int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
int index = 0;
int gas_remain = 0;
int all = 0;
for(int i=0; i<gas.size(); i++){
gas_remain +=(gas[i]-cost[i]);
all +=(gas[i]-cost[i]);
if(gas_remain<0){
index = i+1;
gas_remain =0;
}
}
if(all <0) return -1;
return index;
}
};
参考文章:代码随想录-134. 加油站
135. 分发糖果
class Solution {
public:
int candy(vector<int>& ratings) {
vector<int> candy(ratings.size(), 1);
for(int i=1; i<ratings.size(); i++){
if(ratings[i]>ratings[i-1]){
candy[i] = candy[i-1]+1;
}
}
for(int j=ratings.size()-2; j>=0; j--){
if(ratings[j]>ratings[j+1]){
candy[j] = max(candy[j],candy[j+1]+1);
}
}
int result =0;
for(int i=0; i<candy.size(); i++) result+=candy[i];
return result;
}
};
参考文章:代码随想录- 135. 分发糖果