Leetcode 2391. Minimum Amount of Time to Collect Garbage
You are given a 0-indexed array of strings garbage where garbage[i] represents the assortment of garbage at the ith house. garbage[i] consists only of the characters 'M', 'P' and 'G' representing one unit of metal, paper and glass garbage respectively. Picking up one unit of any type of garbage takes 1 minute.
You are also given a 0-indexed integer array travel where travel[i] is the number of minutes needed to go from house i to house i + 1.
There are three garbage trucks in the city, each responsible for picking up one type of garbage. Each garbage truck starts at house 0 and must visit each house in order; however, they do not need to visit every house.
Only one garbage truck may be used at any given moment. While one truck is driving or picking up garbage, the other two trucks cannot do anything.
Return the minimum number of minutes needed to pick up all the garbage.
Example 1:
Input: garbage = ["G","P","GP","GG"],
travel = [2,4,3]
Output: 21
Explanation:
The paper garbage truck: 1. Travels from house 0 to house 1 2. Collects the paper garbage at house 1 3.
Travels from house 1 to house 2 4. Collects the paper garbage at house 2 Altogether, it takes 8 minutes to pick up all the paper garbage.
The glass garbage truck: 1. Collects the glass garbage at house 0 2. Travels from house 0 to house 1 3. Travels from house 1 to house 2 4. Collects the glass garbage at house 2 5. Travels from house 2 to house 3 6. Collects the glass garbage at house 3 Altogether, it takes 13 minutes to pick up all the glass garbage.
Since there is no metal garbage, we do not need to consider the metal garbage truck. Therefore, it takes a total of 8 + 13 = 21 minutes to collect all the garbage.
Example 2:
Input: garbage = ["MMM","PGM","GP"], travel = [3,10]
Output: 37
Explanation:The metal garbage truck takes 7 minutes to pick up all the metal garbage. The paper garbage truck takes 15 minutes to pick up all the paper garbage. The glass garbage truck takes 15 minutes to pick up all the glass garbage. It takes a total of 7 + 15 + 15 = 37 minutes to collect all the garbage.
收废品了，收废品了啊，先计算每一种垃圾出现的最远的地方，找到之后，分别遍历在0到最远的地方所需要的时间，最后sum求和即可，只是如果只在0出线，其他地方不出现，就不需要travel 的时间了。
逻辑简单些，只是代码长一点而已，还没看大神的代码，肯定很牛的。
Constraints:
2 <= garbage.length <= 105garbage[i]consists of only the letters'M','P', and'G'.1 <= garbage[i].length <= 10travel.length == garbage.length - 11 <= travel[i] <= 100
Runtime: 60 ms, faster than 29.27% of Java online submissions for Minimum Amount of Time to Collect Garbage.
Memory Usage: 67.7 MB, less than 76.47% of Java online submissions for Minimum Amount of Time to Collect Garbage.
