[swift] LeetCode 283. Move Zeroes

Given an array nums, write a function to move all 0’s to the end of it while maintaining the relative order of the non-zero elements.

For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].

Note:
You must do this in-place without making a copy of the array.
Minimize the total number of operations.
Credits:
Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

var j = 0
for i in 0..<nums.count {
    if nums[i] != 0 {
        nums[j] = nums[i]
        j += 1
    }
}
for i in j..<nums.count {
    nums[i] = 0
}

var j = 0

for i in 0..<nums.count {

if nums[i] != 0 {

nums[j] = nums[i]

j += 1

}

for i in j..<nums.count {

nums[i] = 0

}

❤ 点击这里 -> 订阅《PAT | 蓝桥 | LeetCode学习路径 & 刷题经验》by 柳婼

❤ 点击这里 -> 订阅《从放弃C语言到使用C++刷算法的简明教程》by 柳婼

❤ 点击这里 -> 订阅PAT甲级乙级、蓝桥杯、GPLT天梯赛、LeetCode题解离线版