Merge branch 'master' of github.com:baxiang/leetcode-go

Author: baxiang

598range-addition-ii/main.go

@@ -0,0 +1,52 @@
+package main
+
+import "fmt"
+
+func maxCount1(m int, n int, ops [][]int) int {
+	if len(ops) == 0 {
+		return m * n
+	}
+	matrix := make([][]int, m)
+	for i := range matrix {
+		matrix[i] = make([]int, n)
+	}
+
+	for i := 0; i < len(ops); i++ {
+		for j := 0; j < ops[i][0]; j++ {
+			for k := 0; k < ops[i][1]; k++ {
+				matrix[j][k]++
+			}
+		}
+	}
+	max := matrix[0][0]
+	var res int
+	for i := 0; i < m; i++ {
+		for j := 0; j < n; j++ {
+			if max == matrix[i][j] {
+				res++
+			}
+		}
+	}
+	return res
+}
+
+func maxCount(m int, n int, ops [][]int) int {
+	if len(ops) == 0 {
+		return m * n
+	}
+	r := ops[0][0]
+	c := ops[0][1]
+	for i := 1; i < len(ops); i++ {
+		if r > ops[i][0] {
+			r = ops[i][0]
+		}
+		if c > ops[i][1] {
+			c = ops[i][1]
+		}
+	}
+	return r * c
+}
+
+func main() {
+	fmt.Println(maxCount1(3, 3, [][]int{{2, 2}, {3, 3}}))
+}

606construct-string-from-binary-tree/main.go

@@ -0,0 +1,64 @@
+package main
+
+import (
+	"fmt"
+	"strings"
+)
+
+type TreeNode struct {
+	Val   int
+	Left  *TreeNode
+	Right *TreeNode
+}
+
+func tree2str(t *TreeNode) string {
+	var str strings.Builder
+	if t == nil {
+		return ""
+	}
+	stack := []interface{}{t}
+	for len(stack) > 0 {
+		node := stack[len(stack)-1]
+		stack = stack[:len(stack)-1]
+		if n, ok := node.(*TreeNode); ok {
+			str.WriteString(fmt.Sprintf("%d", n.Val))
+			if n.Right != nil {
+				stack = append(stack, ")")
+				stack = append(stack, n.Right)
+				stack = append(stack, "(")
+			}
+			if n.Right != nil && n.Left == nil {
+				stack = append(stack, "()")
+			}
+			if n.Left != nil {
+				stack = append(stack, ")")
+				stack = append(stack, n.Left)
+				stack = append(stack, "(")
+			}
+		} else {
+			s := node.(string)
+			str.WriteString(s)
+		}
+	}
+	return str.String()
+}
+func main() {
+	one := &TreeNode{Val: 1}
+	two := &TreeNode{Val: 2}
+	one.Left = two
+	three := &TreeNode{Val: 3}
+	one.Right = three
+	four := &TreeNode{Val: 4}
+	two.Right = four
+	fmt.Println(tree2str(one))
+
+	//one1 :=&TreeNode{Val: 1}
+	//two1 :=&TreeNode{Val: 2}
+	//one1.Left = two1
+	//three1 :=&TreeNode{Val: 3}
+	//one1.Right = three1
+	//four1 :=&TreeNode{Val: 4}
+	//two1.Right = four1
+	//fmt.Println(tree2str(one1))
+
+}