최근 포스트

[LeetCode] 283. Move Zeroes

최대 1 분 소요

Python class Solution: def moveZeroes(self, nums: List[int]) -> None: """ Do not return anything, modify nums in-place instead. ...

[LeetCode] 189. Rotate Array

최대 1 분 소요

Python class Solution: def rotate(self, nums: List[int], k: int) -> None: """ Do not return anything, modify nums in-place instead. ...

[LeetCode] 704. Binary Search

최대 1 분 소요

Python class Solution: def search(self, nums: List[int], target: int) -> int: index = bisect.bisect_left(nums, target) if index < ...