Leetcode 26. Remove Duplicates from Sorted Array (Java, Javascript,C#,C,C++,Ruby)

nums, remove the duplicates in-place such that each element appears only once and returns 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.

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 a 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]);
}

Example 1:

Input: nums = [1,1,2]
Output: 2, nums = [1,2]
Explanation: 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:

Input: nums = [0,0,1,1,1,2,2,3,3,4]
Output: 5, nums = [0,1,2,3,4]
Explanation: 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.

Constraints:

  • 0 <= nums.length <= 3 * 104
//Javaclass Solution {
public int removeDuplicates(int[] nums) {
if (nums.length == 0 || nums.length == 1)
return nums.length;
int index = 0;
for (int i = 1; i < nums.length; i++) {
if (nums[i - 1] != nums[i])
nums[++index] = nums[i];
}
return index + 1;
}
}
//Javascriptvar removeDuplicates = function(nums) {
if (nums.length == 0 || nums.length == 1)
return nums.length;
let index = 0;
for (let i = 1; i < nums.length; i++) {
if (nums[i - 1] != nums[i])
nums[++index] = nums[i];
}
return index + 1;
};
//Cint removeDuplicates(int *nums, int numsSize)
{
if (numsSize == 0 || numsSize == 1)
return numsSize;
int index = 0;
for (int i = 1; i < numsSize; i++)
{
if (nums[i - 1] != nums[i])
nums[++index] = nums[i];
}
return index + 1;
}
//C++class Solution
{
public:
int removeDuplicates(vector<int> &nums)
{
if (nums.size() == 0 || nums.size() == 1)
return nums.size();
int index = 0;
for (int i = 1; i < nums.size(); i++)
{
if (nums[i - 1] != nums[i])
nums[++index] = nums[i];
}
return index + 1;
}
};
//C#public class Solution
{
public int RemoveDuplicates(int[] nums)
{
if (nums.Length == 0 || nums.Length == 1)
return nums.Length;
int index = 0;
for (int i = 1; i < nums.Length; i++)
{
if (nums[i - 1] != nums[i])
nums[++index] = nums[i];
}
return index + 1;
}
}
//Rubydef remove_duplicates(nums)
if (nums.length == 0 || nums.length == 1)
return nums.length;
end

index = 0;
1.step do |i|
if (nums[i-1] != nums[i])
index = index +1;
nums[index] = nums[i];
end
break if i>=nums.length-1
end
return index + 1;
end

student at Flatiron School