2294. Partition Array Such That Maximum Difference Is K
2294. Partition Array Such That Maximum Difference Is K
這個題目屬於
LeetCode
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
class Solution:
def dailyTemperatures(self, temperatures: List[
496. Next Greater Element I
496. Next Greater Element I
class Solution:
def nextGreaterElement(self,
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,
71. Simplify Path
71. Simplify Path
class Solution:
def simplifyPath(self, path: str)
844. Backspace String Compare
844. Backspace String Compare
class Solution:
def backspaceCompare(self, s:
24. Swap Nodes in Pairs
24. Swap Nodes in Pairs
我一開始的想法比較單純，因為題目是要求奇數跟偶數的位置交換，所以我很直覺的寫了一個先把奇數位置的元素記錄起來，再把偶數元素記錄起來，最後再重新串起來。