Open Shawngbk opened 7 years ago
public class Solution { public void moveZeroes(int[] nums) { int count = 0; for(int i = 0; i < nums.length; i++) { if(nums[i] == 0) count++; } int j = 0; for(int i = 0; i < nums.length; i++) { if(nums[i] != 0) { nums[j] = nums[i]; j++; } } int n = nums.length-1; while(count != 0) { nums[n] = 0; n--; count--; } } }
public class Solution { public void moveZeroes(int[] nums) { int count = 0; for(int i = 0; i < nums.length; i++) { if(nums[i] == 0) count++; } int j = 0; for(int i = 0; i < nums.length; i++) { if(nums[i] != 0) { nums[j] = nums[i]; j++; } } int n = nums.length-1; while(count != 0) { nums[n] = 0; n--; count--; } } }