735. Move All Zeros to End (Recursive)

Given an integer array nums, move all 0s to the end of the array while maintaining the relative order of the non-zero elements. Return the resulting array. You must implement the operation recursively.

Input: An integer array nums.

Output: Return the modified array as [v1,v2,...].

Examples

Input: [0,1,0,3,12]
Output: [1,3,12,0,0]
Explanation: Non-zeros 1, 3, 12 keep order; zeros pushed to end.

Input: [0,0,1]
Output: [1,0,0]
Explanation: 1 moved to front, zeros to end.

Input: [1,2,3]
Output: [1,2,3]
Explanation: No zeros to move.

Constraints

• 1 <= nums.length <= 10^4
• -10^9 <= nums[i] <= 10^9

Asked by