关闭

【leetcode】Move Zeroes

58人阅读 评论(0) 收藏 举报
分类:

Question

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.

Code

#include<iostream>
#include<vector>
using namespace std;

class Solution {
public:
    void moveZeroes(vector<int>& nums) {
        int j = 0;
        for (int i = 0; i < nums.size(); i++) {
            if (nums[i])//若元素不为0
                swap(nums[j++], nums[i]);
        }
        for (int k = 0; k < nums.size(); k++) {//输出
            cout << nums[k]<<" ";
        }
        cout << endl;
    }
};

int main() {
    Solution so;
    vector<int> nums = { 0,1,0,3,12 };
    so.moveZeroes(nums);
    system("pause");
    return  0;
}
0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:7392次
    • 积分:566
    • 等级:
    • 排名:千里之外
    • 原创:52篇
    • 转载:0篇
    • 译文:0篇
    • 评论:0条