283. Move Zeroes
作者:互联网
Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the non-zero elements.
Note that you must do this in-place without making a copy of the array.
Example 1:
Input: nums = [0,1,0,3,12]
Output: [1,3,12,0,0]
Example 2:
Input: nums = [0]
Output: [0]
Constraints:
1 <= nums.length <= 104
-231 <= nums[i] <= 231 - 1
Follow up: Could you minimize the total number of operations done?
Solution:
class Solution {
public:
void moveZeroes(vector<int>& nums) {
int le = 0;
int ri = 0;
while(ri != nums.size())
{
if(nums[ri] != 0)
{
swap(nums[le], nums[ri]);
le++;
}
ri++;
}
}
};
标签:Zeroes,le,nums,int,Move,Input,Output,283,ri 来源: https://www.cnblogs.com/Pomelos/p/15773539.html