2023.12.28 Today's Challenge

https://leetcode.com/problems/minimum-time-to-make-rope-colorful/

Minimum Time to Make Rope Colorful - LeetCode

완탐으로 푸는 문제

class Solution:
    def minCost(self, colors: str, neededTime: List[int]) -> int:
        total, i, j = 0, 0, 0

        while i < len(neededTime) and j < len(neededTime):
            cur_total, cur_max = 0, 0

            while j < len(neededTime) and colors[i] == colors[j]:
                cur_total += neededTime[j]
                cur_max = max(cur_max, neededTime[j])
                j += 1
            
            total += cur_total - cur_max
            i = j
        
        return total