您的位置:首页 > 其它

leetcode283 Move Zeroes

2016-03-05 11:08 393 查看

283. Move Zeroes

Total Accepted:
61066
Total Submissions:
140284
Difficulty: Easy

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.

class Solution {
public:
void moveZeroes(vector<int>& nums) {
vector<int>::iterator it, end;
end = nums.end();
for (it = nums.begin(); it != end;)
{
if (*it == 0)
{
nums.erase(it);
nums.push_back(0);
--end;
continue;
}
++it;
}
}
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: