给定一个数组 nums
,编写一个函数将所有 0
移动到数组的末尾,同时保持非零元素的相对顺序。
请注意 ,必须在不复制数组的情况下原地对数组进行操作。
示例 1:
输入: nums =[0,1,0,3,12]
输出:[1,3,12,0,0]
示例 2:
输入: nums =[0]
输出:[0]
提示:
1 <= nums.length <= 104
-231 <= nums[i] <= 231 - 1
进阶:你能尽量减少完成的操作次数吗?
class Solution:
def moveZeroes(self, nums: List[int]) -> None:
"""
Do not return anything, modify nums in-place instead.
"""
left, n = 0, len(nums)
for right in range(n):
if nums[right] != 0:
nums[left], nums[right] = nums[right], nums[left]
left += 1
class Solution {
public void moveZeroes(int[] nums) {
int left = 0, n = nums.length;
for (int right = 0; right < n; ++right) {
if (nums[right] != 0) {
int t = nums[left];
nums[left] = nums[right];
nums[right] = t;
++left;
}
}
}
}
class Solution {
public:
void moveZeroes(vector<int>& nums) {
int left = 0, n = nums.size();
for (int right = 0; right < n; ++right) {
if (nums[right] != 0)
{
swap(nums[left], nums[right]);
++left;
}
}
}
};
func moveZeroes(nums []int) {
n := len(nums)
left := 0
for right := 0; right < n; right++ {
if nums[right] != 0 {
nums[left], nums[right] = nums[right], nums[left]
left++
}
}
}
/**
* @param {number[]} nums
* @return {void} Do not return anything, modify nums in-place instead.
*/
var moveZeroes = function (nums) {
let left = 0,
n = nums.length;
for (let right = 0; right < n; ++right) {
if (nums[right]) {
[nums[left], nums[right]] = [nums[right], nums[left]];
++left;
}
}
};
/**
* @param {number[]} nums
* @return {void} Do not return anything, modify nums in-place instead.
*/
var moveZeroes = function (nums) {
let left = 0;
let right = left;
while (left < nums.length) {
if (nums[left] != 0) {
left++;
} else {
right = left + 1;
while (right < nums.length) {
if (nums[right] == 0) {
right++;
} else {
let tem = nums[left];
nums[left] = nums[right];
nums[right] = tem;
break;
}
}
left++;
}
}
};
impl Solution {
pub fn move_zeroes(nums: &mut Vec<i32>) {
let mut i = 0;
for j in 0..nums.len() {
if nums[j] != 0 {
if i != j {
nums[i] = nums[j];
nums[j] = 0;
}
i += 1;
}
}
}
}