4065. Rearrange Array by Removing Distinct Values (Leetcode Easy)
Programming Live with Larry
3:23140 views
3 video solutions available
Rearrange Array by Removing Distinct Values - Video Solution
Watch 3 video solutions for Rearrange Array by Removing Distinct Values, a easy level problem. This walkthrough by Programming Live with Larry has 140 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
Problem Statement
You are given an integer array nums.
You start with an empty array ans. Repeat the following operation until nums is empty:
- Identify all distinct values currently present in
nums. - Remove one occurrence of every distinct value currently in
nums, and append those values toansin ascending order.
Return the array ans.
Example 1:
Input: nums = [3,1,3,2,1,3]
Output: [1,2,3,1,3,3]
Explanation:
| Operation | Appended to ans |
nums after |
ans after |
|---|---|---|---|
| 1 | 1, 2, 3 | [3, 1, 3] |
[1, 2, 3] |
| 2 | 1, 3 | [3] |
[1, 2, 3, 1, 3] |
| 3 | 3 | [] |
[1, 2, 3, 1, 3, 3] |
nums is now empty, so the answer is [1, 2, 3, 1, 3, 3].
Example 2:
Input: nums = [7,7,4,4,4]
Output: [4,7,4,7,4]
Explanation:
| Operation | Appended to ans |
nums after |
ans after |
|---|---|---|---|
| 1 | 4, 7 | [7, 4, 4] |
[4, 7] |
| 2 | 4, 7 | [4] |
[4, 7, 4, 7] |
| 3 | 4 | [] |
[4, 7, 4, 7, 4] |
nums is now empty, so the answer is [4, 7, 4, 7, 4].
Constraints:
1 <= nums.length <= 1001 <= nums[i] <= 100