1005.K次取反后最大化的数组和
思路: 将数组排序,每次将负数取反,若K仍未正,再将最小的正数取反,即可得最大数组和。
class Solution {
public:
static bool cmp(int a, int b) { return abs(a) > abs(b); }
int largestSumAfterKNegations(vector<int>& A, int K) {
sort(A.begin(), A.end(), cmp);
for (int i = 0; i < A.size(); i++) {
if (A[i] < 0 && K > 0) {
A[i] *= -1;
K--;
}
}
if (K % 2 == 1)
A[A.size() - 1] *= -1;
int result = 0;
for (int a : A)
result += a;
return result;
}
};
134. 加油站
思路: 首先,总油量大于总消耗量时一定可以跑完一圈。每一段的gas-cost得到rest,从零开始累加rest得到cursum,若此时**cursum[i]**小于零,那么从0到i的区间不可以作为起点,起点从i+1开始。
class Solution {
public:
int canCompleteCircuit(vector<int>& gas, vector<int>& cost) {
int curSum = 0;
int totalSum = 0;
int start = 0;
for (int i = 0; i < gas.size(); i++) {
curSum += gas[i] - cost[i];
totalSum += gas[i] - cost[i];
if (curSum < 0) {
start = i + 1;
curSum = 0;
}
}
if (totalSum < 0) return -1;
return start;
}
};
135. 分发糖果
思路: 本题要求相邻孩子评分高的得到更多的糖果,那么可以左>右,或者左<右。左>右时,左边糖果+1,得到candyvec,左<右时,右边糖果+1,candyvec的同一位置取最大糖果数。
class Solution {
public:
int candy(vector<int>& ratings) {
vector<int> candyVec(ratings.size(), 1);
for (int i = 1; i < ratings.size(); i++) {
if (ratings[i] > ratings[i - 1])
candyVec[i] = candyVec[i - 1] + 1;
}
for (int i = ratings.size() - 2; i >= 0; i--) {
if (ratings[i] > ratings[i + 1]) {
candyVec[i] = max(candyVec[i], candyVec[i + 1] + 1);
}
}
int result = 0;
for (int i = 0; i < candyVec.size(); i++)
result += candyVec[i];
return result;
}
};