feat:slice Intersection

Author: jin06

slice/intersection.go

@@ -0,0 +1,27 @@
+package slice
+
+// Intersection
+// Creates an array of unique values that are included in all given arrays. The order and references of result values are determined by the first array.
+func Intersection[T comparable](arrays [][]T) (result []T) {
+	if len(arrays) < 2 {
+		return
+	}
+	result = arrays[0]
+	for i := 1; i < len(arrays); i++ {
+		result = intersection(result, arrays[i])
+		if len(result) == 0 {
+			break
+		}
+	}
+	return
+}
+
+func intersection[T comparable](arr1 []T, arr2 []T) (result []T) {
+	result = []T{}
+	for i := 0; i < len(arr1); i++ {
+		if IndexOf(arr2, arr1[i], 0) >= 0 {
+			result = append(result, arr1[i])
+		}
+	}
+	return
+}

slice/intersection_test.go

@@ -0,0 +1,15 @@
+package slice
+
+import "fmt"
+
+func ExampleIntersection() {
+	arrays := [][]int{
+		{1, 2, 3, 4, 5, 6},
+		{5, 4, 2},
+		{3, 2, 1, 5},
+	}
+
+	fmt.Println(Intersection(arrays))
+	//Output:
+	//[2 5]
+}