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.
题目大意:
将数组中元素为0的元素放到数组的后面,但是数组中其他非0元素,保持原来的顺序。
代码如下:
class Solution { public: void moveZeroes(vector<int>& nums) { int step = 0; for(int i = 0 ; i < nums.size();i++) { if(nums[i] == 0) { step++; } else { nums[i - step] = nums[i]; if(step != 0) nums[i] = 0; } } } };
2016-08-12 01:26:32
免责声明:本站发布的内容(图片、视频和文字)以原创、转载和分享为主,文章观点不代表本网站立场,如果涉及侵权请联系站长邮箱:is@yisu.com进行举报,并提供相关证据,一经查实,将立刻删除涉嫌侵权内容。