# Leetcode Remove Duplicates from Sorted Array problem solution

In this Leetcode Remove Duplicates from Sorted Array problem solution we have given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears only once. The relative order of the elements should be kept the same.

Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first k elements.

Return k after placing the final result in the first k slots of nums. Do not allocate extra space for another array. You must do this by modifying the input array in place with O(1) extra memory.

## Problem solution in Python.

```class Solution:
def removeDuplicates(self, nums: List[int]) -> int:
p = 0
q = 1
while q < len(nums):
if nums[q] != nums[p]:
nums[p+1] = nums[q]
p += 1
q += 1
return p + 1
```

## Problem solution in Java.

```public int removeDuplicates(int[] nums) {
if(nums == null || nums.length == 0)
{
return 0;
}

int slow = 0;
int fast = 1;
int currentValue = nums[0];

while(fast < nums.length)
{
while(fast < nums.length && nums[fast] == currentValue)
{
fast++;
}

if(fast < nums.length)
{
slow++;
nums[slow] = nums[fast];
currentValue = nums[fast];
}
}
return slow+1;
}
```

## Problem solution in C++.

```class Solution {
public:
int removeDuplicates(vector<int>& nums) {
if (nums.empty())
return 0;

int last = 0;
for (int i = 1; i < nums.size(); ++i) {
if (nums[i] != nums[last]) {
++last;
nums[last] = nums[i];
}
}

nums.resize(last+1);
return nums.size();
}
};
```

## Problem solution in C.

```int removeDuplicates(int* nums, int numsSize){
if(nums == NULL || numsSize < 2)
{
return numsSize;
}

int len = 0, i = 1;
while(i < numsSize)
{
if(nums[i] > nums[len])
{
len++;
nums[len] = nums[i];
}
i++;
}

return 1 + len;
}
```