Merge branch 'develop'

Author: Cori1109

leetcode/1201-1300/1277.Count-Square-Submatrices-with-All-Ones/README.md

@@ -1,15 +1,31 @@
 # [1277.Count Square Submatrices with All Ones][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
 
+Given a m * n matrix of ones and zeros, return how many square submatrices have all ones.
+
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: matrix =
+[
+  [0,1,1,1],
+  [1,1,1,1],
+  [0,1,1,1]
+]
+Output: 15
+```
+
+**Example 2:**
+
+```
+Input: matrix = 
+[
+  [1,0,1],
+  [1,1,0],
+  [1,1,0]
+]
+Output: 7
 ```
 
 ## 题意

leetcode/1201-1300/1277.Count-Square-Submatrices-with-All-Ones/Solution.go

@@ -1,5 +1,24 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(matrix [][]int) int {
+	n, m := len(matrix), len(matrix[0])
+    dp := make([][]int, n + 1)
+    for i := range dp {
+        dp[i] = make([]int, m + 1)
+    }
+    res := 0
+    for i := 1; i < n + 1; i++ {
+        for j := 1; j < m + 1; j++ {
+            if matrix[i - 1][j - 1] == 1 {
+                dp[i][j] = 1 + min(dp[i - 1][j - 1], min(dp[i - 1][j], dp[i][j - 1]))
+            }
+            res += dp[i][j]
+        }
+    }
+    return res
+}
+
+func min(a, b int) int {
+    if a < b { return a }
+    return b
 }

leetcode/1201-1300/1277.Count-Square-Submatrices-with-All-Ones/Solution_test.go

@@ -10,12 +10,19 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		inputs [][]int
+		expect int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase", [][]int{
+			{0,1,1,1},
+			{1,1,1,1},
+			{0,1,1,1},
+		}, 15},
+		{"TestCase", [][]int{
+			{1,0,1},
+			{1,1,0},
+			{1,1,0},
+		}, 7},
 	}
 
 	//	开始测试

leetcode/201-300/0295.Find-Median-from-Data-Stream/README.md

@@ -1,15 +1,27 @@
 # [295.Find Median from Data Stream][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
 
+The median is the middle value in an ordered integer list. If the size of the list is even, there is no middle value and the median is the mean of the two middle values.
+
+    For example, for arr = [2,3,4], the median is 3.
+    For example, for arr = [2,3], the median is (2 + 3) / 2 = 2.5.
+
+Implement the MedianFinder class:
+
+    MedianFinder() initializes the MedianFinder object.
+    void addNum(int num) adds the integer num from the data stream to the data structure.
+    double findMedian() returns the median of all elements so far. Answers within 10-5 of the actual answer will be accepted.
+
+
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input
+["MedianFinder", "addNum", "addNum", "findMedian", "addNum", "findMedian"]
+[[], [1], [2], [], [3], []]
+Output
+[null, null, null, 1.5, null, 2.0]
 ```
 
 ## 题意

leetcode/201-300/0295.Find-Median-from-Data-Stream/Solution.go

@@ -1,5 +1,47 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+import "container/heap"
+
+type IntHeap []int
+
+func (ih IntHeap) Len() int { return len(ih) }
+func (ih IntHeap) Less(i, j int) bool { return ih[i] < ih[j] }
+func (ih IntHeap) Swap(i, j int) { ih[i], ih[j] = ih[j], ih[i] }
+func (ih *IntHeap) Push(num interface{}) {
+	*ih = append(*ih, num.(int))
+}
+func (ih *IntHeap) Pop() interface{} {
+	old := *ih
+	n := ih.Len()
+	num := old[n - 1]
+	*ih = old[: n - 1]
+	return num
+}
+
+type MedianFinder struct {
+	Small IntHeap
+	Large IntHeap
 }
+
+func Constructor() MedianFinder {
+	return MedianFinder{[]int{}, []int{}}
+}
+
+func (mf *MedianFinder) AddNum(num int)  {
+    if mf.Small.Len() == mf.Large.Len() {
+        heap.Push(&mf.Large, -num)
+        val := heap.Pop(&mf.Large)
+        heap.Push(&mf.Small, -(val.(int)))
+    } else {
+        heap.Push(&mf.Small, num)
+        val := heap.Pop(&mf.Small)
+        heap.Push(&mf.Large, -(val.(int)))
+    }
+}
+
+func (mf *MedianFinder) FindMedian() float64 {
+    if mf.Small.Len() == mf.Large.Len() {
+        return float64(mf.Small[0] - mf.Large[0]) / 2
+    }
+    return float64(mf.Small[0])
+}

leetcode/201-300/0295.Find-Median-from-Data-Stream/Solution_test.go

@@ -2,31 +2,52 @@ package Solution
 
 import (
 	"reflect"
-	"strconv"
 	"testing"
 )
 
 func TestSolution(t *testing.T) {
 	//	测试用例
-	cases := []struct {
-		name   string
-		inputs bool
-		expect bool
-	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+	var medianFinder MedianFinder
+	var median float64
+
+	// Test Case 1
+	medianFinder = Constructor()
+	medianFinder.AddNum(1)
+	medianFinder.AddNum(2)
+	median = medianFinder.FindMedian()
+	if !reflect.DeepEqual(median, 1.5) {
+		t.Fatalf("expected: %v, but got: %v", 1.5, median)
+	}
+	medianFinder.AddNum(3)
+	median = medianFinder.FindMedian()
+	if !reflect.DeepEqual(median, 2.0) {
+		t.Fatalf("expected: %v, but got: %v", 2.0, median)
 	}
 
-	//	开始测试
-	for i, c := range cases {
-		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
-			got := Solution(c.inputs)
-			if !reflect.DeepEqual(got, c.expect) {
-				t.Fatalf("expected: %v, but got: %v, with inputs: %v",
-					c.expect, got, c.inputs)
-			}
-		})
+	// Test Case 2
+	medianFinder = Constructor()
+	medianFinder.AddNum(2)
+	medianFinder.AddNum(1)
+	median = medianFinder.FindMedian()
+	if !reflect.DeepEqual(median, 1.5) {
+		t.Fatalf("expected: %v, but got: %v", 1.5, median)
+	}
+	medianFinder.AddNum(5)
+	median = medianFinder.FindMedian()
+	if !reflect.DeepEqual(median, 2.0) {
+		t.Fatalf("expected: %v, but got: %v", 2.0, median)
+	}
+	medianFinder.AddNum(7)
+	medianFinder.AddNum(2)
+	median = medianFinder.FindMedian()
+	if !reflect.DeepEqual(median, 2.0) {
+		t.Fatalf("expected: %v, but got: %v", 2.0, median)
+	}
+	medianFinder.AddNum(0)
+	medianFinder.AddNum(5)
+	median = medianFinder.FindMedian()
+	if !reflect.DeepEqual(median, 2.0) {
+		t.Fatalf("expected: %v, but got: %v", 2.0, median)
 	}
 }
 

leetcode/301-400/0338.Counting-Bits/README.md

@@ -1,15 +1,21 @@
 # [338.Counting Bits][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
 
+Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i.
+
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: n = 2
+Output: [0,1,1]
+```
+
+**Example 2:**
+
+```
+Input: n = 5
+Output: [0,1,1,2,1,2]
 ```
 
 ## 题意

leetcode/301-400/0338.Counting-Bits/Solution.go

@@ -1,5 +1,13 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+func Solution(n int) []int {
+	res := make([]int, n + 1)
+    for i := 1; i < n + 1; i++ {
+        if i % 2 == 0 {
+            res[i] = res[i/2]
+        } else {
+            res[i] = res[i/2] + 1
+        }
+    }
+    return res
 }

leetcode/301-400/0338.Counting-Bits/Solution_test.go

@@ -10,12 +10,12 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		inputs int
+		expect []int
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase", 2, []int{0,1,1}},
+		{"TestCase", 5, []int{0,1,1,2,1,2}},
+		{"TestCase", 10, []int{0,1,1,2,1,2,2,3,1,2,2}},
 	}
 
 	//	开始测试

leetcode/701-800/0791.Custom-Sort-String/README.md

@@ -1,15 +1,20 @@
 # [791.Custom Sort String][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
 
+order and str are strings composed of lowercase letters. In order, no letter occurs more than once.
+
+order was sorted in some custom order previously. We want to permute the characters of str so that they match the order that order was sorted. More specifically, if x occurs before y in order, then x should occur before y in the returned string.
+
+Return any permutation of str (as a string) that satisfies this property.
+
 **Example 1:**
 
 ```
-Input: a = "11", b = "1"
-Output: "100"
+Input: 
+order = "cba"
+str = "abcd"
+Output: "cbad"
 ```
 
 ## 题意

leetcode/701-800/0791.Custom-Sort-String/Solution.go

@@ -1,5 +1,15 @@
 package Solution
 
-func Solution(x bool) bool {
-	return x
+import "sort"
+
+func Solution(order string, str string) string {
+    mapper := make(map[byte]int)
+    for i:= range order {
+        mapper[order[i]] = i - 26
+    }
+    res := []byte(str)
+    sort.Slice(res, func(i, j int) bool {
+        return mapper[res[i]] < mapper[res[j]]
+    })
+    return string(res)
 }

leetcode/701-800/0791.Custom-Sort-String/Solution_test.go

@@ -10,21 +10,21 @@ func TestSolution(t *testing.T) {
 	//	测试用例
 	cases := []struct {
 		name   string
-		inputs bool
-		expect bool
+		order  string
+		str    string
+		expect string
 	}{
-		{"TestCase", true, true},
-		{"TestCase", true, true},
-		{"TestCase", false, false},
+		{"TestCase", "cba", "abcd", "cbad"},
+		{"TestCase", "bee", "bumblebee", "bbbeeelum"},
 	}
 
 	//	开始测试
 	for i, c := range cases {
 		t.Run(c.name+" "+strconv.Itoa(i), func(t *testing.T) {
-			got := Solution(c.inputs)
+			got := Solution(c.order, c.str)
 			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.order, c.str)
 			}
 		})
 	}