Leetcode 283. Move Zeroes (Easy) (cpp)

最新推荐文章于 2025-09-28 09:50:48 发布

原创最新推荐文章于 2025-09-28 09:50:48 发布 · 387 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#leetcode #cpp

C++ 同时被 3 个专栏收录

299 篇文章

订阅专栏

Leetcode C++

287 篇文章

订阅专栏

Leetcode Array

96 篇文章

订阅专栏

本文介绍了解决LeetCode 283题的方法，即如何将数组中的所有零元素移动到数组的末尾，同时保持非零元素的相对顺序不变。采用双指针技术实现原地操作，避免额外空间开销。

Leetcode 283. Move Zeroes (Easy) (cpp)

Tag: Array, Two Pointers

Difficulty: Easy

/*

283. Move Zeroes (Easy)

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) {
		for (int i = 0, j = 0; i < nums.size(); i++) {
			if (nums[i]) {
				swap(nums[i], nums[j++]);
			}
		}
	}
};