27. Remove Element

LeetCode

Pointer

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
class Solution {
    public int removeElement(int[] nums, int val) {
        int pos = 0;
        int n = nums.length;
        for (int i = 0; i < n; i++) {
            if (nums[i] == val) {
                continue;
            } else {
                nums[pos] = nums[i];
                pos++;
            }
        }
        return pos;
    }
}

Remarks:

  1. Same template as No. 26
  2. TC: $O(n)$, SC: $O(1)$