feat(242|349|350|976): has been finish those problem

Author: 彭立衡

favicon.png

@@ -3,8 +3,8 @@ package singleNumber
 func singleNumber(nums []int) int {
 	a, b := 0, 0
 	for i := range nums {
-		a ^= nums[i] &^ b
-		b ^= nums[i] &^ a
+		a = (a ^ nums[i]) &^ b
+		b = (b ^ nums[i]) &^ a
 	}
 	return a
 }

kit/137.SingleNumber2/main.go

@@ -0,0 +1,5 @@
+# [242. Valid Anagram](https://leetcode.com/problems/valid-anagram/)
+
+## 2019/05/15
+
+### 题目 💗[easy]

kit/242.ValidAnagram/README.md

@@ -0,0 +1,10 @@
+package isAnagram
+
+import "fmt"
+
+func isAnagram(s string, t string) bool {
+	for i := range t {
+		fmt.Println(s[i] + t[i])
+	}
+	return true
+}

kit/242.ValidAnagram/main.go

@@ -0,0 +1,45 @@
+package isAnagram
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+type para struct {
+	one string
+	two string
+}
+
+type ans struct {
+	one bool
+}
+
+type question struct {
+	p para
+	a ans
+}
+
+func Test_OK(t *testing.T) {
+	ast := assert.New(t)
+
+	qs := []question{
+		question{
+			p: para{
+				one: "anagram",
+				two: "nagaram",
+			},
+			a: ans{
+				one: true,
+			},
+		},
+	}
+
+	for _, q := range qs {
+		a, p := q.a, q.p
+		ast.Equal(a.one, isAnagram(p.one, p.two), "输入:%v", p)
+	}
+
+	// ast.Panics(func() { longestPalindrome([]int{}, []int{}) }, "对空切片求中位数，却没有panic")
+
+}

kit/242.ValidAnagram/main_test.go

@@ -0,0 +1,7 @@
+# [349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)
+
+## 2019/05/15
+
+### 题目 💗[easy]
+
+交集

kit/349.IntersectionofTwoArrays/README.md

@@ -0,0 +1,22 @@
+package intersection
+
+func intersection(nums1 []int, nums2 []int) []int {
+	res := []int{}
+	for i := 0; i < len(nums1); i++ {
+		for j := 0; j < len(nums2); j++ {
+			if nums1[i] == nums2[j] && indexOf(res, nums1[i]) == -1 {
+				res = append(res, nums1[i])
+			}
+		}
+	}
+	return res
+}
+
+func indexOf(nums []int, val int) int {
+	for i := range nums {
+		if nums[i] == val {
+			return i
+		}
+	}
+	return -1
+}

kit/349.IntersectionofTwoArrays/main.go

@@ -0,0 +1,45 @@
+package intersection
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+type para struct {
+	one []int
+	two []int
+}
+
+type ans struct {
+	one []int
+}
+
+type question struct {
+	p para
+	a ans
+}
+
+func Test_OK(t *testing.T) {
+	ast := assert.New(t)
+
+	qs := []question{
+		question{
+			p: para{
+				one: []int{1, 2, 2, 1},
+				two: []int{2, 2},
+			},
+			a: ans{
+				one: []int{2},
+			},
+		},
+	}
+
+	for _, q := range qs {
+		a, p := q.a, q.p
+		ast.Equal(a.one, intersection(p.one, p.two), "输入:%v", p)
+	}
+
+	// ast.Panics(func() { longestPalindrome([]int{}, []int{}) }, "对空切片求中位数，却没有panic")
+
+}

kit/349.IntersectionofTwoArrays/main_test.go

@@ -0,0 +1,7 @@
+# [349. Intersection of Two Arrays](https://leetcode.com/problems/intersection-of-two-arrays/)
+
+## 2019/05/15
+
+### 题目 💗[easy]
+
+交集

kit/350.IntersectionofTwoArrays2/README.md

@@ -0,0 +1,21 @@
+package intersect
+
+func intersect(nums1 []int, nums2 []int) []int {
+	res := []int{}
+	n, m := len(nums1), len(nums2)
+	for i := 0; i < n; i++ {
+		for j := 0; j < m; j++ {
+			if nums1[i] == nums2[j] {
+				res = append(res, nums1[i])
+				nums1 = append(nums1[:i], nums1[i+1:]...)
+				nums2 = append(nums2[:j], nums2[j+1:]...)
+				n--
+				m--
+				i--
+				j--
+				break
+			}
+		}
+	}
+	return res
+}

kit/350.IntersectionofTwoArrays2/main.go

@@ -0,0 +1,54 @@
+package intersect
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+type para struct {
+	one []int
+	two []int
+}
+
+type ans struct {
+	one []int
+}
+
+type question struct {
+	p para
+	a ans
+}
+
+func Test_OK(t *testing.T) {
+	ast := assert.New(t)
+
+	qs := []question{
+		question{
+			p: para{
+				one: []int{1, 2, 2, 1},
+				two: []int{2},
+			},
+			a: ans{
+				one: []int{2},
+			},
+		},
+		question{
+			p: para{
+				one: []int{4, 9, 5},
+				two: []int{9, 4, 9, 8, 4},
+			},
+			a: ans{
+				one: []int{4, 9},
+			},
+		},
+	}
+
+	for _, q := range qs {
+		a, p := q.a, q.p
+		ast.Equal(a.one, intersect(p.one, p.two), "输入:%v", p)
+	}
+
+	// ast.Panics(func() { longestPalindrome([]int{}, []int{}) }, "对空切片求中位数，却没有panic")
+
+}

kit/350.IntersectionofTwoArrays2/main_test.go

@@ -0,0 +1,15 @@
+# [976. Largest Perimeter Triangle](https://leetcode.com/problems/largest-perimeter-triangle/)
+
+## 2019/05/15
+
+### 题目 💗[easy]
+
+Given an array A of positive lengths, return the largest perimeter of a triangle with non-zero area, formed from 3 of these lengths.
+
+给定一个数组 A,长度>0. 返回最长的由这三个数组成的非零数组周长长度.
+
+---
+
+If it is impossible to form any triangle of non-zero area, return 0.
+
+如果不能返回非零区域长方形,返回 0.

kit/976.LargestPerimeterTriangle/README.md

@@ -0,0 +1,45 @@
+package largestPerimeter
+
+import (
+	"sort"
+)
+
+func largestPerimeter(A []int) int {
+	sort.Ints(A)
+	res := 0
+	for i := len(A) - 1; i > 1; i-- {
+		if A[i] < A[i-1]+A[i-2] {
+			res := A[i] + A[i-1] + A[i-2]
+			return res
+		}
+	}
+	return res
+}
+
+// func largestPerimeter(A []int) int {
+// 	res := 0
+// 	for i := 0; i < len(A)-2; i++ {
+// 		for j := i + 1; j < len(A)-1; j++ {
+// 			for k := j + 1; k < len(A); k++ {
+// 				arr := []int{
+// 					A[i],
+// 					A[j],
+// 					A[k],
+// 				}
+// 				sort.Ints(arr)
+// 				if arr[1]+arr[0] > arr[2] {
+// 					res = max(res, arr[0]+arr[1]+arr[2])
+// 				}
+// 			}
+// 		}
+// 	}
+// 	return res
+// }
+
+// func max(a, b int) int {
+// 	if a > b {
+// 		return a
+// 	} else {
+// 		return b
+// 	}
+// }

kit/976.LargestPerimeterTriangle/main.go

@@ -0,0 +1,51 @@
+package largestPerimeter
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+type para struct {
+	one []int
+}
+
+type ans struct {
+	one int
+}
+
+type question struct {
+	p para
+	a ans
+}
+
+func Test_OK(t *testing.T) {
+	ast := assert.New(t)
+
+	qs := []question{
+		question{
+			p: para{
+				one: []int{2, 1, 2},
+			},
+			a: ans{
+				one: 5,
+			},
+		},
+		// question{
+		// 	p: para{
+		// 		one: []int{1, 2, 1},
+		// 	},
+		// 	a: ans{
+		// 		one: 0,
+		// 	},
+		// },
+	}
+
+	for _, q := range qs {
+		a, p := q.a, q.p
+		ast.Equal(a.one, largestPerimeter(p.one), "输入:%v", p)
+	}
+
+	// ast.Panics(func() { longestPalindrome([]int{}, []int{}) }, "对空切片求中位数，却没有panic")
+
+}