[LeetCode] 66. Plus One
Python class Solution: def plusOne(self, digits: List[int]) -> List[int]: digits = list(map(str, digits)) answer = int(''.join(digits)...
최근 포스트
[LeetCode] 278. First Bad Version
Python ~~~python The isBadVersion API is already defined for you. def isBadVersion(version: int) -> bool:
[LeetCode] 9. Palindrome Number
Python class Solution: def isPalindrome(self, x: int) -> bool: if str(x) == str(x)[::-1]: return True else: re...
[LeetCode] 14. Longest Common Prefix
Python class Solution: def longestCommonPrefix(self, strs: List[str]) -> str: if not strs: return "" temp = min(strs, key=...
[LeetCode] 13. Roman to Integer
Python class Solution: def romanToInt(self, s: str) -> int: temps = { "I": 1, "V": 5, "X": 10, ...