#209 · #1578 · Minimum Time to Make Rope Colorful(使绳子变成彩色的最短时间)

You are given a string colors and an array neededTime where neededTime[i] is the time to remove the i-th balloon. Two adjacent balloons with the same colour must not both remain. Return the minimum total removal time. Constraints: 1 <= colors.length <= 10^5, colors is lowercase letters, 1 <= neededTime[i] <= 10^4.