leetcode 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.
class Solution { public: void moveZeroes(vector<int>& nums) { int n = nums.size(); int index = 0; for (int i = 0; i < n; ++i) { if(nums[i] != 0) nums[index++] = nums[i]; } for (int i = index; i < n; ++i) nums[i] = 0; } };
原文地址:http://www.cnblogs.com/pk28/
与有肝胆人共事,从无字句处读书。
欢迎关注公众号:
欢迎关注公众号: