blob: 9e34c1cee0daffa24a47edd38b842c945a767bca (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
|
#include "leetcode.h"
class Solution {
public:
int minCost(string colors, vector<int> &neededTime) {
int ans = 0, maxCost = 0, sumCost = 0, n = colors.size();
for (int i = 0; i < n; ++i) {
if (i > 0 && colors[i] != colors[i - 1]) {
ans += sumCost - maxCost;
sumCost = maxCost = 0;
}
sumCost += neededTime[i];
maxCost = max(maxCost, neededTime[i]);
}
ans += sumCost - maxCost;
return ans;
}
};
int main() {
Solution obj;
string colors = "abaac";
vector<int> neededTime = {1, 2, 3, 4, 5};
cout << obj.minCost(colors, neededTime);
}
|