Skip to content

C/C++

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.

Read More »LeetCode: 2391-Minimum Amount of Time to Collect Garbage 解題紀錄