...
| Code Block | ||||
|---|---|---|---|---|
| ||||
class Solution:
def inorderTraversal(self, root: TreeNode) -> List[int]:
result = []
def dfs(node):
if not node:
return
dfs(node.left)
result.append(node.val)
dfs(node.right)
dfs(root)
return result |
| Code Block | ||||
|---|---|---|---|---|
| ||||
class Solution:
def finalPrices(self, prices: List[int]) -> List[int]:
result = []
for i in range(len(prices)):
discount = 0
for j in range(i + 1, len(prices)):
if prices[j] <= prices[i]:
discount = prices[j]
break
result.append(prices[i] - discount)
return result |