목록Coding Test 준비/Leetcode (2)

기억노트

[Leetcode/Python3] 70. Climbing Stairs

Code class Solution: def climbStairs(self, n: int) -> int: d = [0] * 46 d[1] = 1 d[2] = 2 for i in range(3, n+1): d[i] = d[i-1] + d[i-2] return d[n] Result Runtime: 41 ms Memory Usage: 14.5 MB
Coding Test 준비/Leetcode 2022. 1. 11. 03:20
[Leetcode/Python3] 121. Best Time to Buy and Sell Stock

Code class Solution: def maxProfit(self, prices: List[int]) -> int: minv = prices[0] res = 0 for x in prices[1:]: minv = min(minv, x) res = max(x - minv, res) return res Result Runtime: 1088 ms Memory Usage: 25.2 MB
Coding Test 준비/Leetcode 2022. 1. 11. 02:58
이전 Prev 1 Next 다음