You are given an integer array nums that is already sorted in non-decreasing order. Your task is to remove the duplicate values in-place so that each element in the array appears only once, while preserving the original relative order of the elements.
After removing the duplicates, let k be the number of unique elements remaining in the array. The first k positions of nums should contain these unique elements in sorted order. Any values beyond index k - 1 are irrelevant and can be ignored.
Your goal is to modify the array in-place and return the value k, representing the count of unique elements.
Constraints:
nums.length
You are given an integer array nums that is already sorted in non-decreasing order. Your task is to remove the duplicate values in-place so that each element in the array appears only once, while preserving the original relative order of the elements.
After removing the duplicates, let k be the number of unique elements remaining in the array. The first k positions of nums should contain these unique elements in sorted order. Any values beyond index k - 1 are irrelevant and can be ignored.
Your goal is to modify the array in-place and return the value k, representing the count of unique elements.
Constraints:
nums.length