Remove Duplicates from Sorted Array

Remove Duplicates from Sorted Array | DevFlow

1int[] nums = [...]; // Input array
2int[] expectedNums = [...]; // The expected answer with correct length
3
4int k = removeDuplicates(nums); // Calls your implementation
5
6assert k == expectedNums.length;
7for (int i = 0; i < k; i++) {
8

1int[] nums = [...]; // Input array
2int[] expectedNums = [...]; // The expected answer with correct length
3
4int k = removeDuplicates(nums); // Calls your implementation
5
6assert k == expectedNums.length;
7for (int i = 0; i < k; i++) {
8

1Input: nums = [1,1,2]
2Output: 2, nums = [1,2,_]
3Explanation: Your function should return k = 2, with the first two elements of nums being 1 and 2 respectively.
4It does not matter what you leave beyond the returned k (hence they are underscores).
5

1Input: nums = [1,1,2]
2Output: 2, nums = [1,2,_]
3Explanation: Your function should return k = 2, with the first two elements of nums being 1 and 2 respectively.
4It does not matter what you leave beyond the returned k (hence they are underscores).
5

1Input: nums = [0,0,1,1,1,2,2,3,3,4]
2Output: 5, nums = [0,1,2,3,4,_,_,_,_,_]
3Explanation: Your function should return k = 5, with the first five elements of nums being

1Input: nums = [0,0,1,1,1,2,2,3,3,4]
2Output: 5, nums = [0,1,2,3,4,_,_,_,_,_]
3Explanation: Your function should return k = 5, with the first five elements of nums being

1/**
2 * @param {number[]} nums
3 * @return {number}
4 */
5var removeDuplicates = function(nums) {
6    if (nums.length === 0) return 0;
7
8    let k = 1; // Index to place the next unique element
9
10    for (let i = 1; i < nums.length; i++) {
11        if (nums[i] !== nums[i - 1]) {
12            nums[k] = nums[i];
13            k++;
14        }
15    }
16
17    return k;
18};

1/**
2 * @param {number[]} nums
3 * @return {number}
4 */
5var removeDuplicates = function(nums) {
6    if (nums.length === 0) return 0;
7
8    let k = 1; // Index to place the next unique element
9
10    for (let i = 1; i < nums.length; i++) {
11        if (nums[i] !== nums[i - 1]) {
12            nums[k] = nums[i];
13            k++;
14        }
15    }
16
17    return k;
18};

All Questions

Top Questions

Popular Tags

Remove Duplicates from Sorted Array

1 Answer

Wirte your answer here