removeelement

.gitignore

@@ -0,0 +1 @@
+testdata

removeelement/readme.md

@@ -0,0 +1,55 @@
+27. Remove Element
+Easy
+
+Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The relative order of the elements may be changed.
+
+Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first k elements.
+
+Return k after placing the final result in the first k slots of nums.
+
+Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory.
+
+Custom Judge:
+
+The judge will test your solution with the following code:
+
+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:
+
+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:
+
+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
+

removeelement/removeelement.go

@@ -0,0 +1,17 @@
+package removeelement
+
+func removeElement(nums []int, val int) int {
+	size := len(nums)
+
+	for i := len(nums) - 1; i >= 0; i-- {
+		if nums[i] == val {
+			size -= 1
+			nums[i], nums[size] = nums[size], nums[i]
+		}
+	}
+	return size
+}
+
+func Remove(nums []int, val int) int {
+	return removeElement(nums, val)
+}

removeelement/removeelement_test.go

@@ -0,0 +1,73 @@
+package removeelement_test
+
+import (
+	"sort"
+	"testing"
+
+	"git.jxs.me/leetgo/removeelement"
+	"github.com/stretchr/testify/require"
+)
+
+func TestEmpty(t *testing.T) {
+	size := removeelement.Remove([]int{}, 0)
+	require.Equal(t, 0, size)
+}
+
+func TestSingle(t *testing.T) {
+	nums := []int{1, 2, 3}
+	expected := []int{1, 3}
+	size := removeelement.Remove(nums, 2)
+	require.Equal(t, 2, size)
+	require.Equal(t, expected, nums[:size])
+}
+
+func TestExample1(t *testing.T) {
+	nums := []int{3, 2, 2, 3}
+	expected := []int{2, 2}
+	size := removeelement.Remove(nums, 3)
+	require.Equal(t, 2, size)
+	require.Equal(t, expected, nums[:size])
+}
+
+func TestExample2(t *testing.T) {
+	nums := []int{0, 1, 2, 2, 3, 0, 4, 2}
+	expected := []int{0, 0, 1, 3, 4}
+	size := removeelement.Remove(nums, 2)
+
+	require.Equal(t, 5, size)
+
+	actual := nums[:size]
+	sort.Ints(actual)
+	require.Equal(t, expected, actual)
+}
+
+func TestExample3(t *testing.T) {
+	nums := []int{0, 1, 2, 2, 3, 0, 4, 2}
+	expected := []int{0, 0, 1, 3, 4}
+	size := removeelement.Remove(nums, 2)
+
+	require.Equal(t, 5, size)
+
+	actual := nums[:size]
+	sort.Ints(actual)
+	require.Equal(t, expected, actual)
+}
+
+func FuzzRemove(f *testing.F) {
+	f.Add([]byte{}, byte(0))
+	f.Add([]byte{3, 2, 2, 3}, byte(3))
+	f.Add([]byte{0, 1, 2, 2, 3, 0, 4, 2}, byte(2))
+	f.Add([]byte{0, 1, 2, 2, 3, 0, 4, 2}, byte(2))
+
+	f.Fuzz(func(t *testing.T, bnums []byte, bval byte) {
+		val := int(bval)
+		nums := make([]int, len(bnums))
+		for i, b := range bnums {
+			nums[i] = int(b)
+		}
+
+		size := removeelement.Remove(nums, val)
+		actual := nums[:size]
+		require.NotContains(t, actual, val)
+	})
+}