Add solution and test-cases for problem 3070

leetcode/3001-3100/3070.Count-Submatrices-with-Top-Left-Element-and-Sum-Less-Than-k/README.md

@@ -1,28 +1,29 @@
 # [3070.Count Submatrices with Top-Left Element and Sum Less Than k][title]
 
-> [!WARNING|style:flat]
-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)
-
 ## Description
+You are given a **0-indexed** integer matrix `grid` and an integer `k`.
+
+Return the **number** of submatrices that contain the top-left element of the `grid`, and have a sum less than or equal to `k`.
+
+**Example 1:**  
 
-**Example 1:**
+![1](./1.png)
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: grid = [[7,6,3],[6,6,1]], k = 18
+Output: 4
+Explanation: There are only 4 submatrices, shown in the image above, that contain the top-left element of grid, and have a sum less than or equal to 18.
 ```
 
-## 题意
-> ...
+**Example 2:**  
 
-## 题解
+![2](./2.png)
 
-### 思路1
-> ...
-Count Submatrices with Top-Left Element and Sum Less Than k
-```go
 ```
-
+Input: grid = [[7,2,9],[1,5,0],[2,6,6]], k = 20
+Output: 6
+Explanation: There are only 6 submatrices, shown in the image above, that contain the top-left element of grid, and have a sum less than or equal to 20.
+```
 
 ## 结语
 

leetcode/3001-3100/3070.Count-Submatrices-with-Top-Left-Element-and-Sum-Less-Than-k/Solution.go

@@ -1,5 +1,27 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(grid [][]int, k int) int {
+	if grid[0][0] > k {
+		return 0
+	}
+	ans := 1
+	for i := 1; i < len(grid[0]); i++ {
+		grid[0][i] = grid[0][i-1] + grid[0][i]
+		if grid[0][i] <= k {
+			ans++
+		}
+
+	}
+	for r := 1; r < len(grid); r++ {
+		cur := 0
+		for c := 0; c < len(grid[0]); c++ {
+			cur += grid[r][c]
+			tmp := cur + grid[r-1][c]
+			if tmp <= k {
+				ans++
+			}
+			grid[r][c] = tmp
+		}
+	}
+	return ans
 }

leetcode/3001-3100/3070.Count-Submatrices-with-Top-Left-Element-and-Sum-Less-Than-k/Solution_test.go

@@ -10,30 +10,30 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		inputs [][]int
+		k      int
+		expect int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase1", [][]int{{7, 6, 3}, {6, 6, 1}}, 18, 4},
+		{"TestCase2", [][]int{{7, 2, 9}, {1, 5, 0}, {2, 6, 6}}, 20, 6},
 	}
 
 	//	开始测试
 	for i, c := range cases {
 		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
-			got := Solution(c.inputs)
+			got := Solution(c.inputs, c.k)
 			if !reflect.DeepEqual(got, c.expect) {
-				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
-					c.expect, got, c.inputs)
+				t.Fatalf("expected: %v, but got: %v, with inputs: %v %v",
+					c.expect, got, c.inputs, c.k)
 			}
 		})
 	}
 }
 
-//	压力测试
+// 压力测试
 func BenchmarkSolution(b *testing.B) {
 }
 
-//	使用案列
+// 使用案列
 func ExampleSolution() {
 }