← 返回 bloomberg 的题目列表Variants of a LeetCode Problem
类型：online_judge
Given an array with a special rule (related to a specific LeetCode problem), implement the algorithm solution following that rule, provide analysis, and test cases.
Hypothetical Example:
Input: nums = [0, 1, 0, 3, 12], Rule: Move all zero elements to the end while maintaining the order of other elements.
Output: [1, 3, 12, 0, 0]
Constraints: 1 <= nums.length <= 1000.
Example
Input
0 1 0 3 12