**Remove Duplicates from Sorted Array**

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:**

1 2 3 4 5 6 7 8 9 |
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:**

1 2 3 4 5 6 7 8 9 |
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:

1 2 3 4 5 6 7 8 9 10 11 12 |
// 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]); } |

**Solution**

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 |
class Solution { /** * @param Integer[] $nums * @return Integer */ function removeDuplicates(&$nums) { $length = count($nums); if ($length > 1) { $last = $nums[0]; for ($i = 1; $i < $length; $i++) { $temp = $nums[$i]; if ($last === $nums[$i]) { unset($nums[$i]); } $last = $temp; } } return count($nums); } } |

**Solution submission screenshot**