本文共 1310 字,大约阅读时间需要 4 分钟。
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 { //用两个指针i,j分别指向0和非0的,如果i
class Solution {public: void moveZeroes(vector & nums) { int j = 0; // move all the nonzero elements advance for (int i = 0; i < nums.size(); i++) { if (nums[i] != 0) { nums[j++] = nums[i]; } } for (;j < nums.size(); j++) { nums[j] = 0; } }};
非常容易理解!!!
转载地址:http://dexvi.baihongyu.com/