## 26. Remove Duplicates from Sorted Array

Given a sorted array *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:

//numsis passed in by reference. (i.e., without making a copy) int len = removeDuplicates(nums); // any modification tonumsin your function would be known by the caller. // using the length returned by your function, it prints the firstlenelements. 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 =, with the first two elements of`2`

being`nums`

and`1`

respectively. It doesn't matter what you leave beyond the returned length.`2`

**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 =, with the first five elements of`5`

being modified to`nums`

,`0`

,`1`

,`2`

, and`3`

respectively. It doesn't matter what values are set beyond the returned length.`4`

**Constraints:**

`0 <= nums.length <= 3 * 10`

^{4}`-10`

^{4}<= nums[i] <= 10^{4}`nums`

is sorted in ascending order.

## Rust Solution

```
struct Solution;
impl Solution {
fn remove_duplicates(nums: &mut Vec<i32>) -> i32 {
let n = nums.len();
if n == 0 {
return 0;
}
let mut last = nums[0];
let mut size = 1;
for i in 1..n {
if nums[i] != last {
last = nums[i];
nums[size] = nums[i];
size += 1;
}
}
size as i32
}
}
#[test]
fn test() {
let mut nums = vec![1, 1, 2];
assert_eq!(Solution::remove_duplicates(&mut nums), 2);
let mut nums = vec![0, 0, 1, 1, 1, 2, 2, 3, 3, 4];
assert_eq!(Solution::remove_duplicates(&mut nums), 5);
}
```

Having problems with this solution? Click here to submit an issue on github.