leet-code-q-68.java

class Solution 
{
    public int minCost(String colors, int[] neededTime) 
    {
        // Step 1: Initialize totalTime to store total minimum time required
        int totalTime = 0;
        
        // Step 2: Traverse through each balloon starting from index 1
        for (int i = 1; i < colors.length(); i++) 
        {
            // Step 3: Compare current balloon color with the previous one
            if (colors.charAt(i) == colors.charAt(i - 1)) 
            {
                // Step 4: If colors are the same, remove the one with smaller neededTime
                totalTime += Math.min(neededTime[i], neededTime[i - 1]);
                
                // Keep the balloon with higher removal time for next comparison
                neededTime[i] = Math.max(neededTime[i], neededTime[i - 1]);
            }
            // Step 5: If colors differ, continue to the next balloon
        }

        // Step 6: Return the total time required to make the rope colorful
        return totalTime;
    }
}