1074 added

Author: aQuaYi

.vscode/settings.json

@@ -154,6 +154,8 @@
         "strings",
         "strs",
         "subarray",
+        "submatrices",
+        "submatrix",
         "subtrees",
         "superpalindrome",
         "superpalindromes",

Algorithms/1074.number-of-submatrices-that-sum-to-target/README.md

@@ -0,0 +1,30 @@
+# [1074. Number of Submatrices That Sum to Target](https://leetcode.com/problems/number-of-submatrices-that-sum-to-target/)
+
+Given a matrix, and a target, return the number of non-empty submatrices that sum to target.
+
+A submatrix x1, y1, x2, y2 is the set of all cells matrix[x][y] with x1 <= x <= x2 and y1 <= y <= y2.
+
+Two submatrices (x1, y1, x2, y2) and (x1', y1', x2', y2') are different if they have some coordinate that is different: for example, if x1 != x1'.
+
+Example 1:
+
+```text
+Input: matrix = [[0,1,0],[1,1,1],[0,1,0]], target = 0
+Output: 4
+Explanation: The four 1x1 submatrices that only contain 0.
+```
+
+Example 2:
+
+```text
+Input: matrix = [[1,-1],[-1,1]], target = 0
+Output: 5
+Explanation: The two 1x2 submatrices, plus the two 2x1 submatrices, plus the 2x2 submatrix.
+```
+
+Note:
+
+1. `1 <= matrix.length <= 300`
+1. `1 <= matrix[0].length <= 300`
+1. `-1000 <= matrix[i] <= 1000`
+1. `-10^8 <= target <= 10^8`

Algorithms/1074.number-of-submatrices-that-sum-to-target/number-of-submatrices-that-sum-to-target.go

@@ -0,0 +1,6 @@
+package problem1074
+
+func numSubmatrixSumTarget(matrix [][]int, target int) int {
+
+return 0
+}

Algorithms/1074.number-of-submatrices-that-sum-to-target/number-of-submatrices-that-sum-to-target_test.go

@@ -0,0 +1,45 @@
+package problem1074
+
+import (
+	"testing"
+
+	"github.com/stretchr/testify/assert"
+)
+
+// tcs is testcase slice
+var tcs = []struct {
+	matrix [][]int
+	target int
+	ans    int
+}{
+
+	{
+		[][]int{{0, 1, 0}, {1, 1, 1}, {0, 1, 0}},
+		0,
+		4,
+	},
+
+	{
+		[][]int{{1, -1}, {-1, 1}},
+		0,
+		5,
+	},
+
+	// 可以有多个 testcase
+}
+
+func Test_numSubmatrixSumTarget(t *testing.T) {
+	ast := assert.New(t)
+
+	for _, tc := range tcs {
+		ast.Equal(tc.ans, numSubmatrixSumTarget(tc.matrix, tc.target), "输入:%v", tc)
+	}
+}
+
+func Benchmark_numSubmatrixSumTarget(b *testing.B) {
+	for i := 0; i < b.N; i++ {
+		for _, tc := range tcs {
+			numSubmatrixSumTarget(tc.matrix, tc.target)
+		}
+	}
+}

leetcode.json

@@ -1,7 +1,7 @@
 {
 	"Username": "aQuaYi",
 	"Ranking": 588,
-	"Updated": "2019-07-12T20:42:24.791388303+08:00",
+	"Updated": "2019-07-13T21:08:01.507144741+08:00",
 	"Record": {
 		"Easy": {
 			"Solved": 250,
@@ -325,7 +325,7 @@
 			"ID": 25,
 			"Title": "Reverse Nodes in k-Group",
 			"TitleSlug": "reverse-nodes-in-k-group",
-			"PassRate": "36%",
+			"PassRate": "37%",
 			"Difficulty": "Hard",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -4525,7 +4525,7 @@
 			"ID": 375,
 			"Title": "Guess Number Higher or Lower II",
 			"TitleSlug": "guess-number-higher-or-lower-ii",
-			"PassRate": "37%",
+			"PassRate": "38%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -4645,7 +4645,7 @@
 			"ID": 385,
 			"Title": "Mini Parser",
 			"TitleSlug": "mini-parser",
-			"PassRate": "31%",
+			"PassRate": "32%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -8581,7 +8581,7 @@
 			"ID": 713,
 			"Title": "Subarray Product Less Than K",
 			"TitleSlug": "subarray-product-less-than-k",
-			"PassRate": "36%",
+			"PassRate": "37%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -9913,7 +9913,7 @@
 			"ID": 824,
 			"Title": "Goat Latin",
 			"TitleSlug": "goat-latin",
-			"PassRate": "57%",
+			"PassRate": "58%",
 			"Difficulty": "Easy",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -10669,7 +10669,7 @@
 			"ID": 887,
 			"Title": "Super Egg Drop",
 			"TitleSlug": "super-egg-drop",
-			"PassRate": "25%",
+			"PassRate": "24%",
 			"Difficulty": "Hard",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -11797,7 +11797,7 @@
 			"ID": 981,
 			"Title": "Time Based Key-Value Store",
 			"TitleSlug": "time-based-key-value-store",
-			"PassRate": "50%",
+			"PassRate": "51%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -11929,7 +11929,7 @@
 			"ID": 992,
 			"Title": "Subarrays with K Different Integers",
 			"TitleSlug": "subarrays-with-k-different-integers",
-			"PassRate": "45%",
+			"PassRate": "44%",
 			"Difficulty": "Hard",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -12493,7 +12493,7 @@
 			"ID": 1039,
 			"Title": "Minimum Score Triangulation of Polygon",
 			"TitleSlug": "minimum-score-triangulation-of-polygon",
-			"PassRate": "41%",
+			"PassRate": "42%",
 			"Difficulty": "Medium",
 			"IsAccepted": true,
 			"IsPaid": false,
@@ -12997,7 +12997,7 @@
 			"ID": 1081,
 			"Title": "Smallest Subsequence of Distinct Characters",
 			"TitleSlug": "smallest-subsequence-of-distinct-characters",
-			"PassRate": "42%",
+			"PassRate": "43%",
 			"Difficulty": "Medium",
 			"IsAccepted": false,
 			"IsPaid": false,
@@ -13081,7 +13081,7 @@
 			"ID": 1088,
 			"Title": "Confusing Number II",
 			"TitleSlug": "confusing-number-ii",
-			"PassRate": "35%",
+			"PassRate": "34%",
 			"Difficulty": "Hard",
 			"IsAccepted": false,
 			"IsPaid": true,
@@ -13326,7 +13326,7 @@
 			"IsAccepted": false,
 			"IsPaid": false,
 			"IsFavor": false,
-			"IsNew": true,
+			"IsNew": false,
 			"HasNoGoOption": false
 		},
 		{
@@ -13338,7 +13338,7 @@
 			"IsAccepted": false,
 			"IsPaid": false,
 			"IsFavor": false,
-			"IsNew": true,
+			"IsNew": false,
 			"HasNoGoOption": false
 		},
 		{
@@ -13350,7 +13350,7 @@
 			"IsAccepted": false,
 			"IsPaid": false,
 			"IsFavor": false,
-			"IsNew": true,
+			"IsNew": false,
 			"HasNoGoOption": false
 		},
 		{
@@ -13362,7 +13362,7 @@
 			"IsAccepted": false,
 			"IsPaid": false,
 			"IsFavor": false,
-			"IsNew": true,
+			"IsNew": false,
 			"HasNoGoOption": false
 		}
 	]