283. Move Zeroes(C++Java)

注：此博客不再更新，所有最新文章将发表在个人独立博客limengting.site。分享技术，记录生活，欢迎大家关注

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.

C++:

class Solution { public: void moveZeroes(vector<int>& nums) { if (nums.empty() || nums.size() == 0) return; int insertPos = 0; for (auto num : nums) { if (num != 0) nums[insertPos++] = num; } while (insertPos < nums.size()) { nums[insertPos++] = 0; } } };

Java:

class Solution { public void moveZeroes(int[] nums) { if (nums == null || nums.length == 0) return; int i = 0; for (int num : nums) if (num != 0) nums[i ++] = num; while (i < nums.length) nums[i ++] = 0; } }