27 Remove Element

27. Remove Element
1. Question
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 by modifying the input array in-placewith 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,
2
​
3
Your function should return length = 2, with the first two elements of nums being 2.
Copied!
2. Implementation
1
public class Solution {
2
    public int removeElement(int[] nums, int val) {
3
        if (nums == null || nums.length == 0) {
4
            return 0;
5
        }
6
​
7
        int index = 0;
8
        for (int num : nums) {
9
            if (num != val) {
10
                nums[index++] = num;
11
            }
12
        }
13
        return index;
14
    }
15
}
Copied!
3. Time & Space Complexity
时间复杂度O(n), 空间复杂度O(1)

26 Remove Duplicates from Sorted Array

30 Substring with Concatenation of All Words

Last modified 2yr ago

Copy link

Contents

27. Remove Element

1. Question

2. Implementation

3. Time & Space Complexity