-
Notifications
You must be signed in to change notification settings - Fork 28
/
27.remove-element.kt
78 lines (76 loc) · 2.02 KB
/
27.remove-element.kt
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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
/*
* @lc app=leetcode id=27 lang=kotlin
*
* [27] Remove Element
*
* https://leetcode.com/problems/remove-element/description/
*
* algorithms
* Easy (43.83%)
* Total Accepted: 390.2K
* Total Submissions: 886K
* Testcase Example: '[3,2,2,3]\n3'
*
* Given an array nums and a value val, 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 by modifying
* the input array in-place with O(1) extra memory.
*
* The order of elements can be changed. It doesn't matter what you leave
* beyond the new length.
*
* Example 1:
*
*
* Given nums = [3,2,2,3], val = 3,
*
* Your function should return length = 2, with the first two elements of nums
* being 2.
*
* It doesn't matter what you leave beyond the returned length.
*
* Example 2:
*
*
* Given nums = [0,1,2,2,3,0,4,2], val = 2,
*
* Your function should return length = 5, with the first five elements of nums
* containing 0, 1, 3, 0, and 4.
*
* Note that the order of those five elements can be arbitrary.
*
* 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:
*
*
* // nums is passed in by reference. (i.e., without making a copy)
* int len = removeElement(nums, val);
*
* // 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]);
* }
*
*/
class Solution {
fun removeElement(nums: IntArray, `val`: Int): Int {
var res = 0
for (i in 0 until nums.size) {
if (nums[i] != `val`) {
nums[res++] = nums[i]
}
}
return res
}
}