Skip to content
Permalink
Branch: master
Find file Copy path
Find file Copy path
Fetching contributors…
Cannot retrieve contributors at this time
44 lines (41 sloc) 811 Bytes
/*
* @lc app=leetcode.cn id=283 lang=cpp
*
* [283] 移动零
*
* https://leetcode-cn.com/problems/move-zeroes/description/
*
* algorithms
* Easy (52.50%)
* Total Accepted: 40.1K
* Total Submissions: 75.3K
* Testcase Example: '[0,1,0,3,12]'
*
* 给定一个数组 nums,编写一个函数将所有 0 移动到数组的末尾,同时保持非零元素的相对顺序。
*
* 示例:
*
* 输入: [0,1,0,3,12]
* 输出: [1,3,12,0,0]
*
* 说明:
*
*
* 必须在原数组上操作,不能拷贝额外的数组。
* 尽量减少操作次数。
*
*
*/
//two pointers
class Solution {
public:
void moveZeroes(vector<int>& nums) {
for (int left = 0, right = 0; right< nums.size();right++)
{
if (nums[right] != 0)
{
swap(nums[right], nums[left++]);
}
}
}
};
You can’t perform that action at this time.