27. Remove Element

```Solution.c int removeElement(int* nums, int numsSize, int val) { int n = numsSize, i = 0; while (i < n) { if (nums[i] == val) { nums[i] = nums[n - 1]; --n; } else { ++i; } } return n; } ``` ```Solution.cpp class Solution { public: int removeElement(vector<int>& nums, int val) { int n = (int)nums.size(); int i = 0; while (i < n) { if (nums[i] == val) { nums[i] = nums[n - 1]; --n; } else { ++i; } } return n; } }; ``` ```Solution.cs public class Solution { public int RemoveElement(int[] nums, int val) { int n = nums.Length, i = 0; while (i < n) { if (nums[i] == val) { nums[i] = nums[n - 1]; n--; } else { i++; } } return n; } } ``` ```Solution.dart class Solution { int removeElement(List<int> nums, int val) { int n = nums.length; int i = 0; while (i < n) { if (nums[i] == val) { nums[i] = nums[n - 1]; n--; } else { i++; } } return n; } } ``` ```Solution.go func removeElement(nums []int, val int) int { n := len(nums) i := 0 for i < n { if nums[i] == val { nums[i] = nums[n-1] n-- } else { i++ } } return n } ``` ```Solution.java class Solution { public int removeElement(int[] nums, int val) { int n = nums.length, i = 0; while (i < n) { if (nums[i] == val) { nums[i] = nums[n - 1]; n--; } else { i++; } } return n; } } ``` ```Solution.js /** * @param {number[]} nums * @param {number} val * @return {number} */ var removeElement = function(nums, val) { let n = nums.length, i = 0; while (i < n) { if (nums[i] === val) { nums[i] = nums[n - 1]; n--; } else { i++; } } return n; }; ``` ```Solution.kt class Solution { fun removeElement(nums: IntArray, `val`: Int): Int { var n = nums.size var i = 0 while (i < n) { if (nums[i] == `val`) { nums[i] = nums[n - 1] n-- } else { i++ } } return n } } ``` ```Solution.php class Solution { /** * @param Integer[] $nums * @param Integer $val * @return Integer */ function removeElement(&$nums, $val) { $n = count($nums); $i = 0; while ($i < $n) { if ($nums[$i] === $val) { $nums[$i] = $nums[$n - 1]; $n--; } else { $i++; } } return $n; } } ``` ```Solution.py class Solution: def removeElement(self, nums: list[int], val: int) -> int: n, i = len(nums), 0 while i < n: if nums[i] == val: nums[i] = nums[n - 1] n -= 1 else: i += 1 return n ``` ```Solution.rb # @param {Integer[]} nums # @param {Integer} val # @return {Integer} def remove_element(nums, val) n = nums.length i = 0 while i < n if nums[i] == val nums[i] = nums[n - 1] n -= 1 else i += 1 end end n end ``` ```Solution.rs impl Solution { pub fn remove_element(nums: &mut Vec<i32>, val: i32) -> i32 { let mut n = nums.len(); let mut i = 0usize; while i < n { if nums[i] == val { nums[i] = nums[n - 1]; n -= 1; } else { i += 1; } } n as i32 } } ``` ```Solution.scala object Solution { def removeElement(nums: Array[Int], v: Int): Int = { var n = nums.length var i = 0 while (i < n) { if (nums(i) == v) { nums(i) = nums(n - 1) n -= 1 } else { i += 1 } } n } } ``` ```Solution.swift class Solution { func removeElement(_ nums: inout [Int], _ val: Int) -> Int { var n = nums.count var i = 0 while i < n { if nums[i] == val { nums[i] = nums[n - 1] n -= 1 } else { i += 1 } } return n } } ``` ```Solution.ts function removeElement(nums: number[], val: number): number { let n = nums.length, i = 0; while (i < n) { if (nums[i] === val) { nums[i] = nums[n - 1]; n--; } else { i++; } } return n; } ```

Author: nendroids

sol/solution/0001-0100/0027/README.md

@@ -0,0 +1,48 @@
+# [**27. Remove Element**](https://leetcode.com/problems/remove-element/description/)
+
+Given an integer array `nums` and an integer `val`, remove all occurrences of `val` in `nums` [**in-place**](https://en.wikipedia.org/wiki/In-place_algorithm). The order of the elements may be changed. Then return the number of elements in `nums` which are not equal to `val`.
+
+Consider the number of elements in `nums` which are not equal to `val` be `k`, to get accepted, you need to do the following things:
+- Change the array `nums` such that the first `k` elements of `nums` contain the elements which are not equal to `val`. The remaining elements of `nums` are not important as well as the size of `nums`.
+- Return `k`.
+
+**Custom Judge:**
+
+The judge will test your solution with the following code:
+```md
+int[] nums = [...]; // Input array
+int val = ...; // Value to remove
+int[] expectedNums = [...]; // The expected answer with correct length.
+ // It is sorted with no values equaling val.
+
+int k = removeElement(nums, val); // Calls your implementation
+
+assert k == expectedNums.length;
+sort(nums, 0, k); // Sort the first k elements of nums
+for (int i = 0; i < actualLength; i++) {
+ assert nums[i] == expectedNums[i];
+}
+```
+If all assertions pass, then your solution will be **accepted**.
+
+#### **Example 1:**
+```md
+Input: nums = [3,2,2,3], val = 3
+Output: 2, nums = [2,2,_,_]
+Explanation: Your function should return k = 2, with the first two elements of nums being 2.
+It does not matter what you leave beyond the returned k (hence they are underscores).
+```
+
+#### **Example 2:**
+```md
+Input: nums = [0,1,2,2,3,0,4,2], val = 2
+Output: 5, nums = [0,1,4,0,3,_,_,_]
+Explanation: Your function should return k = 5, with the first five elements of nums containing 0, 0, 1, 3, and 4.
+Note that the five elements can be returned in any order.
+It does not matter what you leave beyond the returned k (hence they are underscores).
+```
+
+#### **Constraints:**
+> - `0 <= nums.length <= 100`
+> - `0 <= nums[i] <= 50`
+> - `0 <= val <= 100`

sol/solution/0001-0100/0027/Solution.c

@@ -0,0 +1,12 @@
+int removeElement(int* nums, int numsSize, int val) {
+ int n = numsSize, i = 0;
+ while (i < n) {
+ if (nums[i] == val) {
+ nums[i] = nums[n - 1];
+ --n;
+ } else {
+ ++i;
+ }
+ }
+ return n;
+}

sol/solution/0001-0100/0027/Solution.cpp

@@ -0,0 +1,16 @@
+class Solution {
+public:
+ int removeElement(vector<int>& nums, int val) {
+ int n = (int)nums.size();
+ int i = 0;
+ while (i < n) {
+ if (nums[i] == val) {
+ nums[i] = nums[n - 1];
+ --n;
+ } else {
+ ++i;
+ }
+ }
+ return n;
+ }
+};

sol/solution/0001-0100/0027/Solution.cs

@@ -0,0 +1,14 @@
+public class Solution {
+ public int RemoveElement(int[] nums, int val) {
+ int n = nums.Length, i = 0;
+ while (i < n) {
+ if (nums[i] == val) {
+ nums[i] = nums[n - 1];
+ n--;
+ } else {
+ i++;
+ }
+ }
+ return n;
+ }
+}

sol/solution/0001-0100/0027/Solution.dart

@@ -0,0 +1,15 @@
+class Solution {
+ int removeElement(List<int> nums, int val) {
+ int n = nums.length;
+ int i = 0;
+ while (i < n) {
+ if (nums[i] == val) {
+ nums[i] = nums[n - 1];
+ n--;
+ } else {
+ i++;
+ }
+ }
+ return n;
+ }
+}

sol/solution/0001-0100/0027/Solution.erl

@@ -0,0 +1,13 @@
+func removeElement(nums []int, val int) int {
+ n := len(nums)
+ i := 0
+ for i < n {
+ if nums[i] == val {
+ nums[i] = nums[n-1]
+ n--
+ } else {
+ i++
+ }
+ }
+ return n
+}

sol/solution/0001-0100/0027/Solution.ex

@@ -0,0 +1,14 @@
+class Solution {
+ public int removeElement(int[] nums, int val) {
+ int n = nums.length, i = 0;
+ while (i < n) {
+ if (nums[i] == val) {
+ nums[i] = nums[n - 1];
+ n--;
+ } else {
+ i++;
+ }
+ }
+ return n;
+ }
+}

sol/solution/0001-0100/0027/Solution.go

@@ -0,0 +1,17 @@
+/**
+ * @param {number[]} nums
+ * @param {number} val
+ * @return {number}
+ */
+var removeElement = function(nums, val) {
+ let n = nums.length, i = 0;
+ while (i < n) {
+ if (nums[i] === val) {
+ nums[i] = nums[n - 1];
+ n--;
+ } else {
+ i++;
+ }
+ }
+ return n;
+};