My humble Java solution


  • 0
    D
    public class Solution {
        public void moveZeroes(int[] nums) {
            int j = 0;
            for (int i = 0; i<nums.length; i++){
                if (nums[i] == 0 ){continue;}
                nums[j++] = nums[i];
            }
            for (int k = j; k<nums.length; k++){
                nums[k]=0;
            }
            
        }
    }

Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.