| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | ||
| 6 | 7 | 8 | 9 | 10 | 11 | 12 |
| 13 | 14 | 15 | 16 | 17 | 18 | 19 |
| 20 | 21 | 22 | 23 | 24 | 25 | 26 |
| 27 | 28 | 29 | 30 |
Tags
- 시바견
- 715. Range Module
- attribute
- Protocol
- shiba
- kaggle
- 파이썬
- Substring with Concatenation of All Words
- Python
- 운영체제
- Python Code
- DWG
- 109. Convert Sorted List to Binary Search Tree
- concurrency
- Convert Sorted List to Binary Search Tree
- 컴퓨터의 구조
- 30. Substring with Concatenation of All Words
- t1
- Python Implementation
- iterator
- Regular Expression
- 프로그래머스
- Generator
- LeetCode
- 밴픽
- 43. Multiply Strings
- Decorator
- data science
- Class
- 315. Count of Smaller Numbers After Self
Archives
- Today
- Total
목록283. Move Zeroes (1)
Scribbling
LeetCode: 283. Move Zeroes
Using two pointers. class Solution: def moveZeroes(self, nums: List[int]) -> None: """ Do not return anything, modify nums in-place instead. """ j = 0 for i, num in enumerate(nums): if num != 0: nums[j] = num j += 1 for k in range(j, len(nums)): nums[k] = 0
Computer Science/Coding Test
2021. 12. 25. 22:14