-
Notifications
You must be signed in to change notification settings - Fork 30
/
RemoveElement.cs
executable file
·53 lines (49 loc) · 2.88 KB
/
RemoveElement.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
// Source : https://leetcode.com/problems/remove-element/
// Author : codeyu
// Date : Thursday, October 13, 2016 10:42:52 PM
/**********************************************************************************
*
* Given an array and a value, remove all instances of that value in place and return the new length.
*
*
* Do not allocate extra space for another array, you must do this in place with constant memory.
*
* The order of elements can be changed. It doesn't matter what you leave beyond the new length.
*
*
* Example:
* Given input array nums = [3,2,2,3], val = 3
*
*
* Your function should return length = 2, with the first two elements of nums being 2.
*
*
* Try two pointers.
* Did you use the property of "the order of elements can be changed"?
* What happens when the elements to remove are rare?
*
*
**********************************************************************************/
using System;
using System.Collections.Generic;
using Algorithms.Utils;
namespace Algorithms
{
public class Solution027
{
public static int RemoveElement(int[] nums, int val)
{
if(nums.Length == 0 || nums == null) return 0;
var index = 0;
for(var i = 0; i < nums.Length; i++)
{
if(nums[i] != val)
{
nums[index] = nums[i];
index++;
}
}
return index;
}
}
}