LeetCode – Move Zeroes (Java)
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.
For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].
Java Solution 2
We can use the similar code that is used to solve Remove Duplicates from Sorted Array I, II, Remove Element.
public void moveZeroes(int[] nums) { int i = 0; int j = 0; while (j < nums.length) { if (nums[j] != 0) { nums[i++] = nums[j]; } j++; } while (i < nums.length) { nums[i++] = 0; } } |
<pre><code> String foo = "bar"; </code></pre>
-
Amr Hendy
-
Prashi Dell
-
Harmeet Singh
-
Harmeet Singh
-
Cherry Zhao
-
David
-
David
-
Jangku