1751. Maximum Number of Events That Can Be Attended II
1751. Maximum Number of Events That Can Be Attended II
Dynamic Programming
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:
2218. Maximum Value of K Coins From Piles
2218. Maximum Value of K Coins From Piles
這一個題目和 188.
276. Paint Fence
276. Paint Fence
class Solution:
def numWays(self, n: int,
787. Cheapest Flights Within K Stops
787. Cheapest Flights Within K Stops
這一題的考點
1. 在 BFS
1335. Minimum Difficulty of a Job Schedule
1335. Minimum Difficulty of a Job Schedule
這個題目其實寫的滿不清楚的，面試如果遇到這個題目其實也考察如何向面試官搞清楚題目的流程的。
這個題目是給定一個陣列，
1770. Maximum Score from Performing Multiplication Operations
1770. Maximum Score from Performing Multiplication Operations
Top-Down
class Solution:
740. Delete and Earn
740. Delete and Earn
這個題目從題目本身的敘述其實滿容易猜到解法是透過動態規劃求解，比較困難的是要找到符合動態規劃的子問題。
題目給的條件是如果選定一個數字 k，其中如果有 n
1137. N-th Tribonacci Number
1137. N-th Tribonacci Number
自頂向下
class Solution:
def tribonacci(self,