Move Zeroes Java Solution - The Coding Shala
Home >> Interview Questions >> Move Zeroes
Move Zeroes
Problem:
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: [0,1,0,3,12]
Output: [1,3,12,0,0]
Note:
You must do this in-place without making a copy of the array.
Minimize the total number of operations.
Move zeroes Java Solution
Approach:
Using two-pointer.
Java
class Solution { public void moveZeroes(int[] nums) { int zero_index = 0; for(int i=0; i<nums.length; i++){ if(nums[i]!=0){ nums[zero_index] = nums[i]; zero_index++; } } while(zero_index < nums.length){ nums[zero_index] = 0; zero_index++; } } }
Other Posts You May Like
Comments
Post a Comment