提交尝试但未通过的题

Author: halfrost

leetcode/~~~0085.Maximal-Rectangle/85. Maximal Rectangle.go

@@ -0,0 +1,5 @@
+package leetcode
+
+func maximalRectangle(matrix [][]byte) int {
+	return 0
+}

leetcode/~~~0085.Maximal-Rectangle/85. Maximal Rectangle_test.go

@@ -0,0 +1,42 @@
+package leetcode
+
+import (
+	"fmt"
+	"testing"
+)
+
+type question85 struct {
+	para85
+	ans85
+}
+
+// para 是参数
+// one 代表第一个参数
+type para85 struct {
+	one [][]byte
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans85 struct {
+	one int
+}
+
+func Test_Problem85(t *testing.T) {
+
+	qs := []question85{
+
+		question85{
+			para85{[][]byte{[]byte{'1', '0', '1', '0', '0'}, []byte{'1', '0', '1', '1', '1'}, []byte{'1', '1', '1', '1', '1'}, []byte{'1', '0', '0', '1', '0'}}},
+			ans85{6},
+		},
+	}
+
+	fmt.Printf("------------------------Leetcode Problem 85------------------------\n")
+
+	for _, q := range qs {
+		_, p := q.ans85, q.para85
+		fmt.Printf("【input】:%v       【output】:%v\n", p, maximalRectangle(p.one))
+	}
+	fmt.Printf("\n\n\n")
+}

leetcode/~~~0132.Palindrome-Partitioning-II/132. Palindrome Partitioning II.go

@@ -0,0 +1,24 @@
+package leetcode
+
+func minCut(s string) int {
+	if s == "" {
+		return 0
+	}
+	result := len(s)
+	current := make([]string, 0, len(s))
+	dfs132(s, 0, current, &result)
+	return result
+}
+
+func dfs132(s string, idx int, cur []string, result *int) {
+	start, end := idx, len(s)
+	if start == end {
+		*result = min(*result, len(cur)-1)
+		return
+	}
+	for i := start; i < end; i++ {
+		if isPal(s, start, i) {
+			dfs132(s, i+1, append(cur, s[start:i+1]), result)
+		}
+	}
+}

leetcode/~~~0132.Palindrome-Partitioning-II/132. Palindrome Partitioning II_test.go

@@ -0,0 +1,42 @@
+package leetcode
+
+import (
+	"fmt"
+	"testing"
+)
+
+type question132 struct {
+	para132
+	ans132
+}
+
+// para 是参数
+// one 代表第一个参数
+type para132 struct {
+	s string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans132 struct {
+	one int
+}
+
+func Test_Problem132(t *testing.T) {
+
+	qs := []question132{
+
+		question132{
+			para132{"aab"},
+			ans132{1},
+		},
+	}
+
+	fmt.Printf("------------------------Leetcode Problem 132------------------------\n")
+
+	for _, q := range qs {
+		_, p := q.ans132, q.para132
+		fmt.Printf("【input】:%v       【output】:%v\n", p, minCut(p.s))
+	}
+	fmt.Printf("\n\n\n")
+}

leetcode/~~~0316.Remove-Duplicate-Letters/316. Remove Duplicate Letters.go

@@ -0,0 +1,5 @@
+package leetcode
+
+func removeDuplicateLetters(s string) string {
+	return ""
+}

leetcode/~~~0316.Remove-Duplicate-Letters/316. Remove Duplicate Letters_test.go

@@ -0,0 +1,46 @@
+package leetcode
+
+import (
+	"fmt"
+	"testing"
+)
+
+type question316 struct {
+	para316
+	ans316
+}
+
+// para 是参数
+// one 代表第一个参数
+type para316 struct {
+	one string
+}
+
+// ans 是答案
+// one 代表第一个答案
+type ans316 struct {
+	one string
+}
+
+func Test_Problem316(t *testing.T) {
+
+	qs := []question316{
+
+		question316{
+			para316{"bcabc"},
+			ans316{"abc"},
+		},
+		question316{
+			para316{"cbacdcbc"},
+			ans316{"acdb"},
+		},
+	}
+
+	fmt.Printf("------------------------Leetcode Problem 316------------------------\n")
+
+	for _, q := range qs {
+		_, p := q.ans316, q.para316
+		fmt.Printf("【input】:%v       【output】:%v\n", p, removeDuplicateLetters(p.one))
+	}
+	fmt.Printf("\n\n\n")
+}

leetcode/~~~0352.Data-Stream-as-Disjoint-Intervals/352. Data Stream as Disjoint Intervals.go

@@ -0,0 +1,94 @@
+package leetcode
+
+// SummaryRanges define
+type SummaryRanges struct {
+	intervals []Interval
+}
+
+// Constructor352 define
+func Constructor352() SummaryRanges {
+	return SummaryRanges{}
+}
+
+// AddNum define
+func (sr *SummaryRanges) AddNum(val int) {
+	if sr.intervals == nil {
+		sr.intervals = []Interval{
+			Interval{
+				Start: val,
+				End:   val,
+			},
+		}
+		return
+	}
+
+	low, high := 0, len(sr.intervals)-1
+	for low <= high {
+		mid := low + (high-low)>>1
+		if sr.intervals[mid].Start <= val && val <= sr.intervals[mid].End {
+			return
+		} else if val < sr.intervals[mid].Start {
+			high = mid - 1
+		} else {
+			low = mid + 1
+		}
+	}
+
+	if low == 0 {
+		if sr.intervals[0].Start-1 == val {
+			sr.intervals[0].Start--
+			return
+		}
+		ni := Interval{Start: val, End: val}
+		sr.intervals = append(sr.intervals, ni)
+		copy(sr.intervals[1:], sr.intervals)
+		sr.intervals[0] = ni
+		return
+	}
+
+	if low == len(sr.intervals) {
+		if sr.intervals[low-1].End+1 == val {
+			sr.intervals[low-1].End++
+			return
+		}
+		sr.intervals = append(sr.intervals, Interval{Start: val, End: val})
+		return
+	}
+
+	if sr.intervals[low-1].End+1 < val && val < sr.intervals[low].Start-1 {
+		sr.intervals = append(sr.intervals, Interval{})
+		copy(sr.intervals[low+1:], sr.intervals[low:])
+		sr.intervals[low] = Interval{Start: val, End: val}
+		return
+	}
+
+	if sr.intervals[low-1].End == val-1 && val+1 == sr.intervals[low].Start {
+		sr.intervals[low-1].End = sr.intervals[low].End
+		n := len(sr.intervals)
+		copy(sr.intervals[low:], sr.intervals[low+1:])
+		sr.intervals = sr.intervals[:n-1]
+		return
+	}
+
+	if sr.intervals[low-1].End == val-1 {
+		sr.intervals[low-1].End++
+	} else {
+		sr.intervals[low].Start--
+	}
+}
+
+// GetIntervals define
+func (sr *SummaryRanges) GetIntervals() [][]int {
+	intervals := [][]int{}
+	for _, interval := range sr.intervals {
+		intervals = append(intervals, []int{interval.Start, interval.End})
+	}
+	return intervals
+}
+
+/**
+ * Your SummaryRanges object will be instantiated and called as such:
+ * obj := Constructor();
+ * obj.AddNum(val);
+ * param_2 := obj.GetIntervals();
+ */

leetcode/~~~0352.Data-Stream-as-Disjoint-Intervals/352. Data Stream as Disjoint Intervals_test.go

@@ -0,0 +1,21 @@
+package leetcode
+
+import (
+	"fmt"
+	"testing"
+)
+
+func Test_Problem352(t *testing.T) {
+	obj := Constructor352()
+	fmt.Printf("obj = %v\n", obj)
+	obj.AddNum(1)
+	fmt.Printf("Intervals = %v\n", obj.GetIntervals()) // [1,1]
+	obj.AddNum(3)
+	fmt.Printf("Intervals = %v\n", obj.GetIntervals()) // [1,1] [3,3]
+	obj.AddNum(7)
+	fmt.Printf("Intervals = %v\n", obj.GetIntervals()) // [1, 1], [3, 3], [7, 7]
+	obj.AddNum(2)
+	fmt.Printf("Intervals = %v\n", obj.GetIntervals()) // [1, 3], [7, 7]
+	obj.AddNum(6)
+	fmt.Printf("Intervals = %v\n", obj.GetIntervals()) // [1, 3], [6, 7]
+}

leetcode/~~~0363.Max-Sum-of-Rectangle-No-Larger-Than-K/363. Max Sum of Rectangle No Larger Than K.go

@@ -0,0 +1,112 @@
+package leetcode
+
+import (
+	"math"
+)
+
+// 解法一 二分搜索
+func maxSumSubmatrix(matrix [][]int, k int) int {
+	// 转换为前缀和
+	for i := 0; i < len(matrix); i++ {
+		for j := 1; j < len(matrix[0]); j++ {
+			matrix[i][j] += matrix[i][j-1]
+		}
+	}
+	sum, absMax, absMaxFound := make([]int, len(matrix)), 0, false
+	for y1 := 0; y1 < len(matrix[0]); y1++ {
+		for y2 := y1; y2 < len(matrix[0]); y2++ {
+			for x := 0; x < len(matrix); x++ {
+				if y1 == 0 {
+					sum[x] = matrix[x][y2]
+				} else {
+					sum[x] = matrix[x][y2] - matrix[x][y1-1]
+				}
+			}
+			curMax := kadaneK(sum, k)
+			if !absMaxFound || curMax > absMax {
+				absMax = curMax
+				absMaxFound = true
+			}
+		}
+	}
+	return absMax
+}
+
+func kadaneK(a []int, k int) int {
+	sum, sums, maxSoFar := 0, []int{}, math.MinInt32
+	for _, v := range a {
+		// 第一次循环会先插入 0，因为 sum 有可能等于 k
+		sums = insertSort(sums, sum)
+		sum += v
+		pos := binarySearchOfKadane(sums, sum-k)
+		if pos < len(sums) && sum-sums[pos] > maxSoFar {
+			maxSoFar = sum - sums[pos]
+		}
+	}
+	return maxSoFar
+}
+
+func binarySearchOfKadane(a []int, v int) int {
+	low, high := 0, len(a)
+	for low < high {
+		mid := low + (high-low)>>1
+		if a[mid] < v {
+			low = mid + 1
+		} else {
+			high = mid
+		}
+	}
+	return low
+}
+
+func insertSort(a []int, v int) []int {
+	// 类似插入排序，将元素按照从小到大的顺序插入数组
+	p := binarySearchOfKadane(a, v)
+	a = append(a, 0)
+	// 把 p 后面的元素全部往后移，把 p 位置空出来放 v
+	copy(a[p+1:], a[p:len(a)-1])
+	a[p] = v
+	return a
+}
+
+// 解法二 暴力解法，超时
+func maxSumSubmatrix1(matrix [][]int, k int) int {
+	minNum := math.MaxInt64
+	for row := range matrix {
+		for col := 1; col < len(matrix[row]); col++ {
+			if matrix[row][col] < minNum {
+				minNum = matrix[row][col]
+			}
+		}
+	}
+	for row := range matrix {
+		for col := 1; col < len(matrix[row]); col++ {
+			matrix[row][col] += matrix[row][col-1]
+		}
+	}
+	for i := k; ; i-- {
+		if findSumSubmatrix(matrix, i) > 0 {
+			return i
+		}
+	}
+}
+
+func findSumSubmatrix(matrix [][]int, target int) int {
+	m, n, res := len(matrix), len(matrix[0]), 0
+	for i := 0; i < n; i++ {
+		for j := i; j < n; j++ {
+			counterMap, sum := make(map[int]int, m), 0
+			counterMap[0] = 1 // 题目保证一定有解，所以这里初始化是 1
+			for row := 0; row < m; row++ {
+				if i > 0 {
+					sum += matrix[row][j] - matrix[row][i-1]
+				} else {
+					sum += matrix[row][j]
+				}
+				res += counterMap[sum-target]
+				counterMap[sum]++
+			}
+		}
+	}
+	return res
+}