mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-11-04 11:43:12 +08:00
55 lines
2.4 KiB
HTML
55 lines
2.4 KiB
HTML
<p>Given an integer array <code>nums</code> sorted in <strong>non-decreasing order</strong>, remove the duplicates <a href="https://en.wikipedia.org/wiki/In-place_algorithm" target="_blank"><strong>in-place</strong></a> such that each unique element appears only <strong>once</strong>. The <strong>relative order</strong> of the elements should be kept the <strong>same</strong>. Then return <em>the number of unique elements in </em><code>nums</code>.</p>
|
|
|
|
<p>Consider the number of unique elements of <code>nums</code> to be <code>k</code>, to get accepted, you need to do the following things:</p>
|
|
|
|
<ul>
|
|
<li>Change the array <code>nums</code> such that the first <code>k</code> elements of <code>nums</code> contain the unique elements in the order they were present in <code>nums</code> initially. The remaining elements of <code>nums</code> are not important as well as the size of <code>nums</code>.</li>
|
|
<li>Return <code>k</code>.</li>
|
|
</ul>
|
|
|
|
<p><strong>Custom Judge:</strong></p>
|
|
|
|
<p>The judge will test your solution with the following code:</p>
|
|
|
|
<pre>
|
|
int[] nums = [...]; // Input array
|
|
int[] expectedNums = [...]; // The expected answer with correct length
|
|
|
|
int k = removeDuplicates(nums); // Calls your implementation
|
|
|
|
assert k == expectedNums.length;
|
|
for (int i = 0; i < k; i++) {
|
|
assert nums[i] == expectedNums[i];
|
|
}
|
|
</pre>
|
|
|
|
<p>If all assertions pass, then your solution will be <strong>accepted</strong>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [1,1,2]
|
|
<strong>Output:</strong> 2, nums = [1,2,_]
|
|
<strong>Explanation:</strong> Your function should return k = 2, with the first two elements of nums being 1 and 2 respectively.
|
|
It does not matter what you leave beyond the returned k (hence they are underscores).
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> nums = [0,0,1,1,1,2,2,3,3,4]
|
|
<strong>Output:</strong> 5, nums = [0,1,2,3,4,_,_,_,_,_]
|
|
<strong>Explanation:</strong> Your function should return k = 5, with the first five elements of nums being 0, 1, 2, 3, and 4 respectively.
|
|
It does not matter what you leave beyond the returned k (hence they are underscores).
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= nums.length <= 3 * 10<sup>4</sup></code></li>
|
|
<li><code>-100 <= nums[i] <= 100</code></li>
|
|
<li><code>nums</code> is sorted in <strong>non-decreasing</strong> order.</li>
|
|
</ul>
|