feat: update golang solution to lcof problems: No.60,62,63

maolonglong · maolonglong · commit 7d9380e00b49 · 2021-06-14T13:28:19.000+08:00
diff --git a/lcof/&#38754;&#35797;&#39064;60. n&#20010;&#39600;&#23376;&#30340;&#28857;&#25968;/README.md b/lcof/&#38754;&#35797;&#39064;60. n&#20010;&#39600;&#23376;&#30340;&#28857;&#25968;/README.md
@@ -129,6 +129,28 @@ var twoSum = function (n) {
 };
 ```
 
+### **Go**
+
+```go
+func dicesProbability(n int) []float64 {
+	dp := make([]float64, 7)
+	for i := 1; i <= 6; i++ {
+		dp[i] = 1.0 / 6.0
+	}
+	for i := 2; i <= n; i++ {
+		n := len(dp)
+		tmp := make([]float64, 6*i+1)
+		for j := 0; j < n; j++ {
+			for k := 1; k <= 6; k++ {
+				tmp[j+k] += dp[j] / 6.0
+			}
+		}
+		dp = tmp
+	}
+	return dp[n:]
+}
+```
+
 ### **...**
 
 ```
diff --git a/lcof/&#38754;&#35797;&#39064;60. n&#20010;&#39600;&#23376;&#30340;&#28857;&#25968;/Solution.go b/lcof/&#38754;&#35797;&#39064;60. n&#20010;&#39600;&#23376;&#30340;&#28857;&#25968;/Solution.go
@@ -0,0 +1,17 @@
+func dicesProbability(n int) []float64 {
+	dp := make([]float64, 7)
+	for i := 1; i <= 6; i++ {
+		dp[i] = 1.0 / 6.0
+	}
+	for i := 2; i <= n; i++ {
+		n := len(dp)
+		tmp := make([]float64, 6*i+1)
+		for j := 0; j < n; j++ {
+			for k := 1; k <= 6; k++ {
+				tmp[j+k] += dp[j] / 6.0
+			}
+		}
+		dp = tmp
+	}
+	return dp[n:]
+}
diff --git a/lcof/&#38754;&#35797;&#39064;62. &#22278;&#22280;&#20013;&#26368;&#21518;&#21097;&#19979;&#30340;&#25968;&#23383;/README.md b/lcof/&#38754;&#35797;&#39064;62. &#22278;&#22280;&#20013;&#26368;&#21518;&#21097;&#19979;&#30340;&#25968;&#23383;/README.md
@@ -105,6 +105,18 @@ var lastRemaining = function (n, m) {
 };
 ```
 
+### **Go**
+
+```go
+func lastRemaining(n int, m int) int {
+	f := 0
+	for i := 2; i <= n; i++ {
+		f = (f + m) % i
+	}
+	return f
+}
+```
+
 ### **...**
 
 ```
diff --git a/lcof/&#38754;&#35797;&#39064;62. &#22278;&#22280;&#20013;&#26368;&#21518;&#21097;&#19979;&#30340;&#25968;&#23383;/Solution.go b/lcof/&#38754;&#35797;&#39064;62. &#22278;&#22280;&#20013;&#26368;&#21518;&#21097;&#19979;&#30340;&#25968;&#23383;/Solution.go
@@ -0,0 +1,7 @@
+func lastRemaining(n int, m int) int {
+	f := 0
+	for i := 2; i <= n; i++ {
+		f = (f + m) % i
+	}
+	return f
+}
diff --git a/lcof/&#38754;&#35797;&#39064;63. &#32929;&#31080;&#30340;&#26368;&#22823;&#21033;&#28070;/README.md b/lcof/&#38754;&#35797;&#39064;63. &#32929;&#31080;&#30340;&#26368;&#22823;&#21033;&#28070;/README.md
@@ -113,6 +113,33 @@ public:
 };
 ```
 
+### **Go**
+
+```go
+func maxProfit(prices []int) int {
+	mi, mx := math.MaxInt32, 0
+	for _, price := range prices {
+		mx = max(mx, price-mi)
+		mi = min(mi, price)
+	}
+    return mx
+}
+
+func min(x, y int) int {
+	if x < y {
+		return x
+	}
+	return y
+}
+
+func max(x, y int) int {
+	if x > y {
+		return x
+	}
+	return y
+}
+```
+
 ### **...**
 
 ```
diff --git a/lcof/&#38754;&#35797;&#39064;63. &#32929;&#31080;&#30340;&#26368;&#22823;&#21033;&#28070;/Solution.go b/lcof/&#38754;&#35797;&#39064;63. &#32929;&#31080;&#30340;&#26368;&#22823;&#21033;&#28070;/Solution.go
@@ -0,0 +1,22 @@
+func maxProfit(prices []int) int {
+	mi, mx := math.MaxInt32, 0
+	for _, price := range prices {
+		mx = max(mx, price-mi)
+		mi = min(mi, price)
+	}
+	return mx
+}
+
+func min(x, y int) int {
+	if x < y {
+		return x
+	}
+	return y
+}
+
+func max(x, y int) int {
+	if x > y {
+		return x
+	}
+	return y
+}
