931. Minimum Falling Path Sum
931. Minimum Falling Path Sum
class Solution:
def minFallingPathSum(self,
LeetCode
63. Unique Paths II
63. Unique Paths II
class Solution:
def uniquePathsWithObstacles(self, obstacleGrid:
2218. Maximum Value of K Coins From Piles
2218. Maximum Value of K Coins From Piles
這一個題目和 188.
2342. Max Sum of a Pair With Equal Sum of Digits
2342. Max Sum of a Pair With Equal Sum of
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 來做，不過有一個小地方是要怎麼處理
1133. Largest Unique Number
1133. Largest Unique Number
class Solution:
def largestUniqueNumber(self, nums:
2225. Find Players With Zero or One Losses
2225. Find Players With Zero or One Losses
class Solution:
2294. Partition Array Such That Maximum Difference Is K
2294. Partition Array Such That Maximum Difference Is K
這個題目屬於