leetcode 1578. Minimum Time to Make Rope Colorful

Medium

93838Add to ListShare

Alice has n balloons arranged on a rope. You are given a 0-indexed string colors where colors[i] is the color of the ith balloon.

Alice wants the rope to be colorful. She does not want two consecutive balloons to be of the same color, so she asks Bob for help. Bob can remove some balloons from the rope to make it colorful. You are given a 0-indexed integer array neededTime where neededTime[i] is the time (in seconds) that Bob needs to remove the ith balloon from the rope.

Return the minimum time Bob needs to make the rope colorful.

Example 1:

Input: colors = "abaac", neededTime = [1,2,3,4,5]Output: 3Explanation: In the above image, 'a' is blue, 'b' is red, and 'c' is green. Bob can remove the blue balloon at index 2. This takes 3 seconds. There are no longer two consecutive balloons of the same color. Total time = 3.

Example 2:

Input: colors = "abc", neededTime = [1,2,3]Output: 0Explanation: The rope is already colorful. Bob does not need to remove any balloons from the rope.

Example 3:

Input: colors = "aabaa", neededTime = [1,2,3,4,1]Output: 2Explanation: Bob will remove the ballons at indices 0 and 4. Each ballon takes 1 second to remove. There are no longer two consecutive balloons of the same color. Total time = 1 + 1 = 2.

Constraints:

• n == colors.length == neededTime.length

• 1 <= n <= 105

• 1 <= neededTime[i] <= 104

• colors contains only lowercase English letters.

Runtime: 5 ms, faster than 98.81% of Java online submissions for Minimum Time to Make Rope Colorful.

Memory Usage: 51.1 MB, less than 89.11% of Java online submissions for Minimum Time to Make Rope Colorful.

用一个变量，来存储第一个数据，以后依次跟后面的进行比对，相同的时候，ans加一下2个的最小值，然后让后面的值等于较大的值，为啥等于较大的值，主要是题解是要最小值，那就要较大值去做比较更好些；以此类推就行的。