-
Notifications
You must be signed in to change notification settings - Fork 30
/
RemoveDuplicatesfromSortedArray.cs
executable file
·48 lines (45 loc) · 2.61 KB
/
RemoveDuplicatesfromSortedArray.cs
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
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
// Source : https://leetcode.com/problems/remove-duplicates-from-sorted-array/
// Author : codeyu
// Date : Wednesday, October 12, 2016 8:57:00 PM
/**********************************************************************************
*
*
* Given a sorted array, 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 in place with constant memory.
*
*
*
* For example,
* Given input array 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 new length.
*
*
**********************************************************************************/
using System;
using System.Collections.Generic;
using Algorithms.Utils;
namespace Algorithms
{
public class Solution026
{
public static int RemoveDuplicates(int[] nums)
{
if(nums.Length <= 1) return nums.Length;
var index = 1;
for(var i=1; i<nums.Length;i++)
{
if(nums[i] != nums[index-1])
{
nums[index] = nums[i];
index++;
}
}
return index;
}
}
}