-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution.cs
21 lines (19 loc) · 938 Bytes
/
Solution.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
namespace LeetCode.Problem26{
//26. Remove Duplicates from Sorted Array
//https://leetcode.com/problems/remove-duplicates-from-sorted-array
/*
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. Then return the number of unique elements in nums.
Consider the number of unique elements of nums to be k, to get accepted, you need to do the following things:
Change the array nums such that the first k elements of nums contain the unique elements in the order they were present
in nums initially. The remaining elements of nums are not important as well as the size of nums.
Return k.
*/
public class Solution {
public int RemoveDuplicates(int[] nums) {
HashSet<int> numbers = new HashSet<int>(nums);
numbers.CopyTo(nums);
return numbers.Count;
}
}
}