* intersection of two array

Author: yangguang_chen

README.md

@@ -13,6 +13,7 @@
 - [198.house-robber](./src/198-HouseRobber/house_robber.go)
 - [231.power-of-two](./src/231-PowerOfTwo/power_of2.go)
 - [290.word-pattern](./src/290-WordPattern/word_pattern.go)
+- [349.intersection-of-two-array](./src/349-IntersectionOf2Array/inter_of2.go)
 - [367.valid-perfect-square](./src/367-ValidPerfectSquare/367-valid-perfect-square.go)
 - [704.binary-search](./src/704-BinarySearch/704-binary-search.go)
 

src/349-IntersectionOf2Array/inter_of2_arr.go

@@ -0,0 +1,41 @@
+// Given two arrays, write a function to compute their intersection.
+// Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2].
+// Note:
+// Each element in the result must be unique.
+// The result can be in any order.
+
+package inof2arr
+
+import (
+	"strconv"
+)
+
+func IntersectionOf2Array(iarr1, iarr2 []int) []int {
+	var ret []int
+	len1 := len(iarr1)
+	len2 := len(iarr2)
+
+	var maxLen, minLen int
+	if len1 > len2 {
+		maxLen = len1
+		minLen = len2
+	} else {
+		maxLen = len2
+		maxLen = len1
+	}
+
+	m := make(map[string]int)
+	for i := 0; i < maxLen; i++ {
+		for j := 0; j < minLen; j++ {
+			if iarr1[i] != iarr2[j] {
+				continue
+			}
+			k := strconv.Itoa(i)
+			m[k] = iarr1[i]
+			if _, ok := m[k]; !ok {
+				ret = append(ret, iarr1[i])
+			}
+		}
+	}
+	return ret
+}

src/349-IntersectionOf2Array/inter_of2_arr_test.go

@@ -0,0 +1,19 @@
+package inof2arr
+
+import (
+	"testing"
+)
+
+func TestIntersectionOf2Array(t *testing.T) {
+	arr_1 := []int{1, 1, 2, 2}
+	arr_2 := []int{2, 2}
+
+	res := IntersectionOf2Array(arr_1, arr_2)
+	for _, v := range res {
+		if v == 2 {
+			t.Log("arr_1:", arr_1, " and arr_2:", arr_2, " have intersection partition")
+			break
+		}
+		t.Error("arr_1:", arr_1, " and arr_2:", arr_2, " have no intersection partition")
+	}
+}