leetcode 1578. 使绳子变成彩色的最短时间-Minimum Time to Make Rope Colorful

Problem: 1578. 使绳子变成彩色的最短时间-Minimum Time to Make Rope Colorful对任何相邻且相等的子字符串对应的neededTime子数组排序然后累加保留最后一个数字的Codeclass Solution { public: int minCost(string colors, vectorint neededTime) { colors -; neededTime.push_back(0); int n neededTime.size(), pre 0, sum 0, r; char c colors[0]; for(int i 1; i n; i) { if(c ! colors[i]) { if(i - pre 1) sort(neededTime.begin() pre, neededTime.begin() i); r i - 1; for(int j pre; j r; j) sum neededTime[j]; pre i; c colors[i]; } } return sum; } };