O(N) Java in place solution


  • 0
    B
    public class Solution {
        public void moveZeroes(int[] nums) {
            int count = 0;
            
            for (int i = 0; i < nums.length; i++) {
                if (nums[i] == 0)
                    count++;
                else {
                    nums[i-count] = nums[i];
                }
            }
            
            for (int i = nums.length - count; i < nums.length; i++)
                    nums[i] = 0;
        }
    }

Log in to reply
 

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