leetcode 283. Move Zeroes
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.Example:
Input:
Output:
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(int[] nums) {
int count = 0;
for(int i = 0 ; i< nums.length; i++){
if(nums != 0){
nums = nums;
if(count != i) {
nums = 0;
}
count++;
}
}
}
}
页:
[1]