Gary Lai

829. Consecutive Numbers Sum

829. Consecutive Numbers Sum 這個題目我覺得不用太糾結於最佳解,這個偏向數學題目,但是我覺的是很好的面試題目 首先第一的絕對是不能先去想要怎麼拆解數字,我是先停下來觀察了一下什麼是連續正整數相加。像是:

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:

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

2130. Maximum Twin Sum of a Linked List

2130. Maximum Twin Sum of a Linked List 1. 用快慢指針找到中間點,

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 class Solution: def maxNumberOfBalloons(self,