Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
Note that you must do this in-place without making a copy of the array.
Example 1:
Input: nums = [0,1,0,3,12]
Output: [1,3,12,0,0]
Example 2:
Input: nums = [0]
Output: [0]
Constraints:
- 1 <= nums.length <= 104
- -231 <= nums[i] <= 231 - 1
class Solution:
def moveZeroes(self, nums: List[int]) -> None:
"""
Do not return anything, modify nums in-place instead.
"""
lp=0
ans=[0 for x in range(len(nums))]
for i in nums:
if i != 0:
ans[lp]=i
lp+=1
for i in range(len(ans)):
nums[i]=ans[i]'알고리즘 문제 > Leetcode' 카테고리의 다른 글
| 844. Backspace String Compare (2) | 2022.12.28 |
|---|---|
| 3. Longest Substring Without Repeating Characters (0) | 2022.12.28 |
| 88. Merge Sorted Array (0) | 2022.12.27 |
| 1984. Minimum Difference Between Highest and Lowest of K Scores (0) | 2022.12.27 |
| 680. Valid Palindrome II (0) | 2022.12.27 |