-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathRemoveDuplicatesFromSortedArray.cs
59 lines (41 loc) · 1.34 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
48
49
50
51
52
53
54
55
56
57
58
59
using System;
using System.Collections.Generic;
using System.Linq;
using System.Threading.Tasks;
namespace LeetCodeSolutions
{
// Source: https://leetcode.com/problems/remove-duplicates-from-sorted-array
// Author: Jalal Shabo
// Date : 11/24/2023
// Time Complexity: O(n) one look through array, two pointer solution faster.
// Space Complexity: O(1) no extra data structures used
public static class RemoveDuplicatesFromSortedArray
{
public static int RemoveDuplicatesFromSortedArraySolution(int[] nums)
{
int prevNumber = nums[0], arrayPosition = 1;
for (int i = 1; i <= nums.Length - 1; i++)
{
if (nums[i] != prevNumber)
{
nums[arrayPosition] = nums[i];
arrayPosition++;
prevNumber = nums[i];
}
}
return arrayPosition;
}
public static int RemoveDuplicatesFromSortedArrayTwoPointerSolution(int[] nums)
{
int leftPtr = 1;
for (int i = 1; i <= nums.Length-1; i++)
{
if(nums[i] != nums[i-1]){
nums[leftPtr] = nums[i];
leftPtr++;
}
}
return leftPtr;
}
}
}