Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 283 with 15 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 283 # by problem number
lcpy gen -s move_zeroes # by problem name
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.
Input: nums = [0,1,0,3,12]
Output: [1,3,12,0,0]
Explanation: The array after moving zeroes becomes [1,3,12,0,0].
Input: nums = [0]
Output: [0]
class Solution:
# Two pointers - slow tracks insertion position for next non-zero
# Fast scans array; swap non-zero to front, preserving relative order
# Time: O(n)
# Space: O(1)
def move_zeroes(self, nums: list[int]) -> None:
slow = 0
for fast in range(len(nums)):
if nums[fast] != 0:
nums[slow], nums[fast] = nums[fast], nums[slow]
slow += 1
| Time | Space |
|---|---|
| O(n) | O(1) |