Leetcode之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.
Note:
- You must do this in-place without making a copy of the array.
- Minimize the total number of operations.
示例:
For example, given nums = [0, 1, 0, 3, 12]
, after calling your function,nums
should be
[1, 3, 12, 0, 0]
.
问题来源:Move Zeroes (详细地址:https://leetcode.com/problems/move-zeroes/description/)
思路分析:这道题的题目意思很简单,就是把非0数字往前移,0全部移到后面去。那么我们用一个计数器count来记录不等于0的数字的个数,利用指针i遍历数组时,如果当前的这个数不等于0,那我们就把i指向的数赋值给计数器count指向的位置,把i指向的数赋值为0(必须是i在count前面才能这么赋0),然后count++,直到遍历完就OK了。
代码: