il - leetcode-26: Remove Duplicates from Sorted Array

leetcode-study/leetcode-26/go.mod

@@ -0,0 +1,5 @@
+module github.com/emahiro/il/leetcode-26
+
+go 1.20
+
+require golang.org/x/exp v0.0.0-20230420155640-133eef4313cb

leetcode-study/leetcode-26/go.sum

@@ -0,0 +1,2 @@
+golang.org/x/exp v0.0.0-20230420155640-133eef4313cb h1:rhjz/8Mbfa8xROFiH+MQphmAmgqRM0bOMnytznhWEXk=
+golang.org/x/exp v0.0.0-20230420155640-133eef4313cb/go.mod h1:V1LtkGg67GoY2N1AnLN78QLrzxkLyJw7RJb1gzOOz9w=

leetcode-study/leetcode-26/main.go

@@ -0,0 +1,5 @@
+package main
+
+import "fmt"
+
+func main() { fmt.Println("hello world") }

leetcode-study/leetcode-26/main_test.go

@@ -0,0 +1,60 @@
+package main
+
+import (
+	"testing"
+
+	"golang.org/x/exp/slices"
+)
+
+func uniqNormal(s *[]int) {
+	m := make(map[int]struct{})
+	for _, v := range *s {
+		m[v] = struct{}{}
+	}
+	*s = (*s)[:0]
+	for k := range m {
+		*s = append(*s, k)
+	}
+}
+
+func uniqFast(s *[]int) {
+	offset := 1
+	for i := 1; i < len(*s); i++ {
+		if (*s)[i] != (*s)[i-1] {
+			(*s)[offset] = (*s)[i]
+			offset++
+		}
+	}
+	*s = (*s)[:offset]
+}
+
+func uniqGen[T comparable](s *[]T) {
+	_ = slices.Compact(*s)
+}
+
+func Benchmark(b *testing.B) {
+	b.ReportAllocs()
+
+	list := []int{1, 1, 2, 2}
+
+	b.Run("unique normal", func(b *testing.B) {
+		b.ResetTimer()
+		for i := 0; i < b.N; i++ {
+			uniqNormal(&list)
+		}
+	})
+
+	b.Run("unique faster", func(b *testing.B) {
+		b.ResetTimer()
+		for i := 0; i < b.N; i++ {
+			uniqFast(&list)
+		}
+	})
+
+	b.Run("unique generic", func(b *testing.B) {
+		b.ResetTimer()
+		for i := 0; i < b.N; i++ {
+			uniqGen(&list)
+		}
+	})
+}