Remove Duplicates from Sorted Array (E)
題目
Given a sorted array nums, remove the duplicates in-place such that each element appear only once and return the new length.
Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.
Example 1:
Given nums = [1,1,2],
Your function should return length = 2, with the first two elements of nums being 1 and 2 respectively.
It doesn't matter what you leave beyond the returned length.
Example 2:
Given nums = [0,0,1,1,1,2,2,3,3,4],
Your function should return length = 5, with the first five elements of nums being modified to 0, 1, 2, 3, and 4 respectively.
It doesn't matter what values are set beyond the returned length.
Clarification:
Confused why the returned value is an integer but your answer is an array?
Note that the input array is passed in by reference, which means modification to the input array will be known to the caller as well.
Internally you can think of this:
// nums is passed in by reference. (i.e., without making a copy)
int len = removeDuplicates(nums);
// any modification to nums in your function would be known by the caller.
// using the length returned by your function, it prints the first len elements.
for (int i = 0; i < len; i++) {
print(nums[i]);
}
題意
給定一個有序陣列，要求將陣列中不重復的元素依次排在陣列前部，并回傳不重復元素的個數，
思路
因為陣列有序，直接遍歷處理即可，
代碼實作
Java
class Solution {
public int removeDuplicates(int[] nums) {
int p = 0;
for (int i = 0; i < nums.length; i++) {
if (i > 0 && nums[i] == nums[i - 1]) {
continue;
}
nums[p++] = nums[i];
}
return p;
}
}
JavaScript
/**
* @param {number[]} nums
* @return {number}
*/
var removeDuplicates = function (nums) {
let p = 0, q = 0
let pre
while (q < nums.length) {
if (pre === undefined || nums[q] !== pre) {
nums[p++] = nums[q]
pre = nums[q]
}
q++
}
return p
}
轉載請註明出處，本文鏈接：https://www.uj5u.com/qita/41166.html
標籤：其他