1751. Maximum Number of Events That Can Be Attended II 1751. Maximum Number of Events That Can Be Attended II
1992. Find All Groups of Farmland 1992. Find All Groups of Farmland class Solution: def findFarmland(
2300. Successful Pairs of Spells and Potions 2300. Successful Pairs of Spells and Potions class Solution: def
931. Minimum Falling Path Sum 931. Minimum Falling Path Sum class Solution: def minFallingPathSum(self,
63. Unique Paths II 63. Unique Paths II class Solution: def uniquePathsWithObstacles(self, obstacleGrid:
2260. Minimum Consecutive Cards to Pick Up 2260. Minimum Consecutive Cards to Pick Up class Solution: def
2287. Rearrange Characters to Make Target String 2287. Rearrange Characters to Make Target String 同 1189. Maximum
1189. Maximum Number of Balloons 1189. Maximum Number of Balloons 這個題目其實很容易看得出來是用 Hash Table 來做,不過有一個小地方是要怎麼處理