feat: for mat

Author: plh97

algorithm/160.IntersectionofTwoLinkedLists/main_test.go

@@ -14,11 +14,11 @@ var tcs = []struct {
 	N2  *Helper.ListNode
 	ans *Helper.ListNode
 }{
-	// {
-	// 	Helper.Ints2LinkList([]int{4, 1, 8, 4, 5}),
-	// 	Helper.Ints2LinkList([]int{5, 0, 1, 8, 4, 5}),
-	// 	nil,
-	// },
+	{
+		Helper.Ints2LinkList([]int{4, 1, 8, 4, 5}),
+		Helper.Ints2LinkList([]int{5, 0, 1, 8, 4, 5}),
+		nil,
+	},
 }
 
 func Test_bitwiseComplement(t *testing.T) {

algorithm/34.FindFirstandLastPositionofElementinSortedArray/main_test.go

@@ -16,6 +16,11 @@ var tcs = []struct {
 		8,
 		[]int{3, 4},
 	},
+	{
+		[]int{5, 7, 7, 8, 8, 10},
+		9,
+		[]int{-1, -1},
+	},
 }
 
 func Test_bitwiseComplement(t *testing.T) {

algorithm/450.DeleteNodeaBST/README.md

@@ -5,7 +5,7 @@ import (
 )
 
 func merge(intervals [][]int) [][]int {
-	sortArray(intervals, 0)
+	// sortArray(intervals, 0)
 	for i := 0; i < len(intervals); i++ {
 		for j := i + 1; j < len(intervals); j++ {
 			a := intervals[i]
@@ -31,21 +31,21 @@ func merge(intervals [][]int) [][]int {
 }
 
 // pop sort
-func sortArray(arr [][]int, index int) [][]int {
-	if index > len(arr) {
-		return arr
-	}
-	if len(arr) < 2 {
-		return arr
-	}
-	for i := 0; i < len(arr); i++ {
-		ei := arr[i]
-		for j := i + 1; j < len(arr); j++ {
-			ej := arr[j]
-			if ei[index] > ej[index] {
-				arr[i], arr[j] = arr[j], arr[i]
-			}
-		}
-	}
-	return arr
-}
+// func sortArray(arr [][]int, index int) [][]int {
+// 	if index > len(arr) {
+// 		return arr
+// 	}
+// 	if len(arr) < 2 {
+// 		return arr
+// 	}
+// 	for i := 0; i < len(arr); i++ {
+// 		ei := arr[i]
+// 		for j := i + 1; j < len(arr); j++ {
+// 			ej := arr[j]
+// 			if ei[index] > ej[index] {
+// 				arr[i], arr[j] = arr[j], arr[i]
+// 			}
+// 		}
+// 	}
+// 	return arr
+// }

algorithm/450.DeleteNodeaBST/main.go

@@ -44,16 +44,16 @@ var tcs = []struct {
 			[]int{0, 4},
 		},
 	},
-	{
-		[][]int{
-			[]int{1, 4},
-			[]int{0, 0},
-		},
-		[][]int{
-			[]int{0, 0},
-			[]int{1, 4},
-		},
-	},
+	// {
+	// 	[][]int{
+	// 		[]int{1, 4},
+	// 		[]int{0, 0},
+	// 	},
+	// 	[][]int{
+	// 		[]int{0, 0},
+	// 		[]int{1, 4},
+	// 	},
+	// },
 	{
 		[][]int{
 			[]int{1, 4},

algorithm/450.DeleteNodeaBST/main_test.go

@@ -0,0 +1,6 @@
+# [73. Set Matrix Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)
+
+## 2019/08/25
+
+### 题目 💗[medium]
+

algorithm/56.MergeIntervals/main.go

@@ -0,0 +1,31 @@
+package setZeroes
+
+func setZeroes(matrix [][]int) [][]int {
+	xx := []int{}
+	yy := []int{}
+	for y, cols := range matrix {
+		for x, e := range cols {
+			if e == 0 {
+				xx = append(xx, x)
+				yy = append(yy, y)
+			}
+		}
+	}
+	for y, cols := range matrix {
+		for x := range cols {
+			if indexOf(xx, x) > -1 || indexOf(yy, y) > -1 {
+				matrix[y][x] = 0
+			}
+		}
+	}
+	return matrix
+}
+
+func indexOf(nums []int, val int) int {
+	for i := range nums {
+		if nums[i] == val {
+			return i
+		}
+	}
+	return -1
+}

algorithm/56.MergeIntervals/main_test.go

@@ -0,0 +1,32 @@
+package setZeroes
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+var tcs = []struct {
+	N1  [][]int
+	ans [][]int
+}{
+	{
+		[][]int{
+			[]int{1, 1, 1},
+			[]int{1, 0, 1},
+			[]int{1, 1, 1},
+		},
+		[][]int{
+			[]int{1, 0, 1},
+			[]int{0, 0, 0},
+			[]int{1, 0, 1},
+		},
+	},
+}
+
+func Test_bitwiseComplement(t *testing.T) {
+	ast := assert.New(t)
+	for _, tc := range tcs {
+		ast.Equal(tc.ans, setZeroes(tc.N1), "输入:%v", tc)
+	}
+}

algorithm/73.SetMatrixZeroes/README.md

@@ -0,0 +1,24 @@
+# [79. Word Search](https://leetcode.com/problems/word-search/)
+
+## 2019/09/18
+
+### 题目 💗[medium]
+
+Given a 2D board and a word, find if the word exists in the grid.
+
+The word can be constructed from letters of sequentially adjacent cell, where "adjacent" cells are those horizontally or vertically neighboring. The same letter cell may not be used more than once.
+
+Example:
+
+```bash
+board =
+[
+  ['A','B','C','E'],
+  ['S','F','C','S'],
+  ['A','D','E','E']
+]
+
+Given word = "ABCCED", return true.
+Given word = "SEE", return true.
+Given word = "ABCB", return false.
+```

algorithm/73.SetMatrixZeroes/main.go

@@ -0,0 +1,6 @@
+package exist
+
+func exist(board [][]byte, word string) bool {
+	for i,j:=0,0; 
+	return true
+}