Skip to content

Commit d537d0d

Browse files
committed
Solution as on 20-02-2022 09:36 am
1 parent ff5aef5 commit d537d0d

File tree

1 file changed

+20
-0
lines changed

1 file changed

+20
-0
lines changed
Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
// 1578.✅ Minimum Time to Make Rope Colorful
2+
3+
class Solution
4+
{
5+
public:
6+
int minCost(string colors, vector<int> &neededTime)
7+
{
8+
int res = 0;
9+
10+
for (int i = 1; i < colors.size(); ++i)
11+
{
12+
if (colors[i] == colors[i - 1])
13+
{
14+
res += min(neededTime[i], neededTime[i - 1]);
15+
neededTime[i] = max(neededTime[i], neededTime[i - 1]);
16+
}
17+
}
18+
return res;
19+
}
20+
};

0 commit comments

Comments
 (0)