[LeetCode] 88. Merge Sorted Array
Python class Solution: def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None: """ Do not return anything, modify...
최근 포스트
[LeetCode] 476. Number Complement
Python class Solution: def findComplement(self, num: int) -> int: binary = bin(num)[2:] answer = '' for i in binary: ...
[LeetCode] 191. Number of 1 Bits
Python class Solution: def hammingWeight(self, n: int) -> int: return bin(n).count('1')
[LeetCode] 448. Find All Numbers Disappeared in an Array
Python class Solution: def findDisappearedNumbers(self, nums: List[int]) -> List[int]: return set(range(1, len(nums) + 1)) - set(nums)
[Programmers] H-Index
Python def solution(citations): citations.sort() for i in range(len(citations)): if citations[i] >= len(citations) - i: return...