_:n9da0dfe75bd6438c9b4f0d0087affa18xb0
<http://schema.org/description>
"The task is as follows: 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. The last note is actually the important part. Without this, it would be easy to just use array splitting in Python and add a zero. This would look similar to this: if nums[pos] == 0: nums = nums[:pos] + nums[pos+1:] + [0] This obviously overrides nums and the change is no longer in place. The next best solution that I found was to delete the items at position I from the list and then add a zero to the end. It is important to note, that the index needs to be decremented by one in case a 0 is found to account for double 0. The number of steps needs to always be increased."
<https://fewald.net/leetcode/2022/10/02/leetcode-move-zeros.html>