LeetCode : Move Zeroes

来源:互联网 发布:购买淘宝小号安全吗 编辑:程序博客网 时间:2024/05/20 05:54

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>result = nums;        nums.clear();        for(int i=0;i<result.size();++i)        {            if(result[i]!=0)            {                nums.push_back(result[i]);            }        }        for(int i=0;i<result.size();++i)        {            if(result[i]==0)               nums.push_back(0);        }    }};
0 0
原创粉丝点击