LeetCode-in-All
283. Move Zeroes
Easy
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
impl Solution {
pub fn move_zeroes(nums: &mut Vec<i32>) {
let mut first_zero = 0;
for i in 0..nums.len() {
if nums[i] != 0 {
Solution::swap(first_zero, i, nums);
first_zero += 1;
}
}
}
fn swap(index1: usize, index2: usize, nums: &mut Vec<i32>) {
nums.swap(index1, index2);
}
}