[LeetCode] 121. Best Time to Buy and Sell Stock
Python class Solution: def maxProfit(self, prices: List[int]) -> int: answer = 0 num = sys.maxsize for price in prices: ...
최근 포스트
[LeetCode] 53. Maximum Subarray
Python class Solution: def maxSubArray(self, nums: List[int]) -> int: answer = -sys.maxsize sum_num = 0 for num in nums: ...
[LeetCode] 231. Power of Two
Python class Solution: def isPowerOfTwo(self, n: int) -> bool: if n == 0: return False while n != 1: if n % 2 ...
[LeetCode] 326. Power of Three
Python class Solution: def isPowerOfThree(self, n: int) -> bool: if n == 0: return False while n != 1: if n % ...
[LeetCode] 2351. First Letter to Appear Twice
Python class Solution: def repeatedCharacter(self, s: str) -> str: temp = {} for i in s: if i not in temp: ...