update

Author: ldeng7

000xxx/123.go

@@ -0,0 +1,21 @@
+func max(a, b int) int {
+	if a < b {
+		return b
+	}
+	return a
+}
+
+func maxProfit(prices []int) int {
+	if 0 == len(prices) {
+		return 0
+	}
+	g, l := [3]int{}, [3]int{}
+	for i := 0; i < len(prices)-1; i++ {
+		d := prices[i+1] - prices[i]
+		for j := 2; j >= 1; j-- {
+			l[j] = max(g[j-1]+max(d, 0), l[j]+d)
+			g[j] = max(l[j], g[j])
+		}
+	}
+	return g[2]
+}

000xxx/124.go

@@ -0,0 +1,24 @@
+import "math"
+
+func max(a, b int) int {
+	if a < b {
+		return b
+	}
+	return a
+}
+
+func cal(n *TreeNode, o *int) int {
+	if nil == n {
+		return 0
+	}
+	l := max(cal(n.Left, o), 0)
+	r := max(cal(n.Right, o), 0)
+	*o = max(*o, l+r+n.Val)
+	return max(l, r) + n.Val
+}
+
+func maxPathSum(root *TreeNode) int {
+	o := math.MinInt64
+	cal(root, &o)
+	return o
+}

000xxx/128.go

@@ -0,0 +1,16 @@
+func longestConsecutive(nums []int) int {
+	out := 0
+	m := map[int]int{}
+	for _, num := range nums {
+		if _, ok := m[num]; ok {
+			continue
+		}
+		l, r := m[num-1], m[num+1]
+		s := l + r + 1
+		m[num], m[num-l], m[num+r] = s, s, s
+		if s > out {
+			out = s
+		}
+	}
+	return out
+}

000xxx/129.go

@@ -0,0 +1,14 @@
+func cal(n *TreeNode, s int) int {
+	if nil == n {
+		return 0
+	}
+	s = s*10 + n.Val
+	if nil == n.Left && nil == n.Right {
+		return s
+	}
+	return cal(n.Left, s) + cal(n.Right, s)
+}
+
+func sumNumbers(root *TreeNode) int {
+	return cal(root, 0)
+}

000xxx/131.go

@@ -0,0 +1,37 @@
+func partition(s string) [][]string {
+	l := len(s)
+	out := [][]string{}
+	ar := []string{}
+	t := make([][]bool, l)
+	for i := 0; i < l; i++ {
+		t[i] = make([]bool, l)
+	}
+	for i := 0; i < l; i++ {
+		for j := 0; j <= i; j++ {
+			if s[i] == s[j] && (i-j <= 2 || t[j+1][i-1]) {
+				t[j][i] = true
+			}
+		}
+	}
+
+	var cal func(int)
+	cal = func(b int) {
+		if b == l {
+			ar1 := make([]string, len(ar))
+			copy(ar1, ar)
+			out = append(out, ar1)
+			return
+		}
+		for i := b; i < l; i++ {
+			if !t[b][i] {
+				continue
+			}
+			ar = append(ar, s[b:i+1])
+			cal(i + 1)
+			ar = ar[:len(ar)-1]
+		}
+	}
+
+	cal(0)
+	return out
+}

000xxx/132.go

@@ -0,0 +1,29 @@
+import "math"
+
+func min(a, b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}
+
+func minCut(s string) int {
+	l := len(s)
+	if 0 == l {
+		return 0
+	}
+	t := make([]int, l+1)
+	t[0] = -1
+	for i := 1; i <= l; i++ {
+		t[i] = math.MaxInt64
+	}
+	for i := 0; i < l; i++ {
+		for j := 0; i-j >= 0 && i+j < l && s[i-j] == s[i+j]; j++ {
+			t[i+j+1] = min(t[i+j+1], t[i-j]+1)
+		}
+		for j := 0; i-j >= 0 && i+j+1 < l && s[i-j] == s[i+j+1]; j++ {
+			t[i+j+2] = min(t[i+j+2], t[i-j]+1)
+		}
+	}
+	return t[l]
+}

000xxx/133.go

@@ -0,0 +1,2 @@
+// TODO
+// golang unsuppoted

000xxx/134.go

@@ -0,0 +1,13 @@
+func canCompleteCircuit(gas []int, cost []int) int {
+	s, b, m := 0, 0, -1
+	for i := len(gas) - 1; i >= 0; i-- {
+		s += gas[i] - cost[i]
+		if s > m {
+			b, m = i, s
+		}
+	}
+	if s < 0 {
+		return -1
+	}
+	return b
+}

000xxx/135.go

@@ -0,0 +1,29 @@
+func max(a, b int) int {
+	if a < b {
+		return b
+	}
+	return a
+}
+
+func candy(ratings []int) int {
+	l := len(ratings)
+	t := make([]int, l)
+	for i := 0; i < l; i++ {
+		t[i] = 1
+	}
+	for i := 0; i < l-1; i++ {
+		if ratings[i+1] > ratings[i] {
+			t[i+1] = t[i] + 1
+		}
+	}
+	for i := l - 1; i > 0; i-- {
+		if ratings[i-1] > ratings[i] {
+			t[i-1] = max(t[i-1], t[i]+1)
+		}
+	}
+	o := 0
+	for _, e := range t {
+		o += e
+	}
+	return o
+}

000xxx/138.go

@@ -0,0 +1,2 @@
+// TODO
+// golang unsuppoted