leetcode

0 class Solution {

1 public:

2 int minCost(const string &colors, const vector<int> &neededTime) {

3 int res = 0, prev = neededTime[0];

4 for (int i = 1; i < colors.size(); i++) {

5 if (colors[i] != colors[i - 1]) {

6 prev = neededTime[i];

7 continue;

8 }

9 if (neededTime[i] < prev)

10 res += neededTime[i];

11 else {

12 res += prev;

13 prev = neededTime[i];

14 }

15 }

16 return res;

17 }

18 };