1189. Maximum Number of Balloons
1189. Maximum Number of Balloons
這個題目其實很容易看得出來是用 Hash Table 來做，不過有一個小地方是要怎麼處理
Gary Lai
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
這個題目屬於
2126. Destroying Asteroids
2126. Destroying Asteroids
class Solution:
def asteroidsDestroyed(self, mass: int,
901. Online Stock Span
901. Online Stock Span
這個題目真的算是非常難，沒有寫過的話面試真的很難有機會寫出來。
class StockSpanner:
def __init_
739. Daily Temperatures
739. Daily Temperatures
題目給定一個陣列，裡面是一段時間日子的每日溫度，我們要找出每一天，再經過幾天後，就會遇到一個比較溫暖的天氣。
這個題目是一個單調棧 Monotonic
496. Next Greater Element I
496. Next Greater Element I
這一題是 Monotonic 的題目，但是他的變形其實滿難的，會建議先從
346. Moving Average from Data Stream
346. Moving Average from Data Stream
class MovingAverage:
def __init_
1544. Make The String Great
1544. Make The String Great
class Solution:
def makeGood(self,