1578. Minimum Time to Make Rope Colorful(DP)

最新推荐文章于 2024-09-09 22:01:06 发布

ZustinLau

最新推荐文章于 2024-09-09 22:01:06 发布

阅读量180

点赞数

分类专栏： Leetcode 動態規劃文章标签： leetcode 算法职场和发展

本文链接：https://blog.csdn.net/weixin_58286631/article/details/125013721

版权

Leetcode 同时被 2 个专栏收录

53 篇文章 0 订阅

订阅专栏

動態規劃

49 篇文章 0 订阅

订阅专栏

Pretty straightforward!

We want to make the array colorful which does not allow the same color to appear consecutively.

If the same color appears consecutively, we only want to reserve the biggest cost one and delete

others, because it can guarantee our cost is minimum.

class Solution {
public:
    int minCost(string colors, vector<int>& cost) {
        int n = colors.length();
        int sum = 0, maxCost = 0, ans = 0;
        for(int i = 0; i < n; i++){
            //count for a color
            if(i > 0 && colors[i] != colors[i - 1]){
                ans += sum - maxCost;
                sum = 0;
                maxCost = 0;
            }
            sum += cost[i];
            maxCost = max(cost[i], maxCost);
        }
        ans += sum - maxCost;
        return ans;
    }
};