Minimum Time to Make Rope Colorful LeetCode solution in C++

1
class Solution {
2
 public:
3
  int minCost(string colors, vector<int> &neededTime) {
4
    int time = 0;
5
    for (int i = 0; i < colors.length() - 1; i++) {
6
      if (colors[i] == colors[i + 1]) {
7
        if (neededTime[i] > neededTime[i + 1]) {
8
          swap(neededTime[i], neededTime[i + 1]);
9
        }
10
        time += min(neededTime[i], neededTime[i + 1]);
11
      }
12
    }
13
    return time;
14
  }
15
};