fix(Go): update solution to lc problem: No.0410 (doocs#895)

No.0410. Split Array Largest Sum

Author: atompi

solution/0400-0499/0410.Split Array Largest Sum/README.md

@@ -156,15 +156,15 @@ public:
 ### **Go**
 
 ```go
-func splitArray(nums []int, m int) int {
+func splitArray(nums []int, k int) int {
 	mx := -1
 	for _, num := range nums {
 		mx = max(mx, num)
 	}
 	left, right := mx, int(1e9)
 	for left < right {
 		mid := (left + right) >> 1
-		if check(nums, m, mid) {
+		if check(nums, k, mid) {
 			right = mid
 		} else {
 			left = mid + 1
@@ -173,7 +173,7 @@ func splitArray(nums []int, m int) int {
 	return left
 }
 
-func check(nums []int, m, x int) bool {
+func check(nums []int, k, x int) bool {
 	s, cnt := 0, 1
 	for _, num := range nums {
 		if s+num > x {
@@ -183,7 +183,7 @@ func check(nums []int, m, x int) bool {
 			s += num
 		}
 	}
-	return cnt <= m
+	return cnt <= k
 }
 
 func max(a, b int) int {

solution/0400-0499/0410.Split Array Largest Sum/README_EN.md

@@ -140,15 +140,15 @@ public:
 ### **Go**
 
 ```go
-func splitArray(nums []int, m int) int {
+func splitArray(nums []int, k int) int {
 	mx := -1
 	for _, num := range nums {
 		mx = max(mx, num)
 	}
 	left, right := mx, int(1e9)
 	for left < right {
 		mid := (left + right) >> 1
-		if check(nums, m, mid) {
+		if check(nums, k, mid) {
 			right = mid
 		} else {
 			left = mid + 1
@@ -157,7 +157,7 @@ func splitArray(nums []int, m int) int {
 	return left
 }
 
-func check(nums []int, m, x int) bool {
+func check(nums []int, k, x int) bool {
 	s, cnt := 0, 1
 	for _, num := range nums {
 		if s+num > x {
@@ -167,7 +167,7 @@ func check(nums []int, m, x int) bool {
 			s += num
 		}
 	}
-	return cnt <= m
+	return cnt <= k
 }
 
 func max(a, b int) int {

solution/0400-0499/0410.Split Array Largest Sum/Solution.go

@@ -1,12 +1,12 @@
-func splitArray(nums []int, m int) int {
+func splitArray(nums []int, k int) int {
 	mx := -1
 	for _, num := range nums {
 		mx = max(mx, num)
 	}
 	left, right := mx, int(1e9)
 	for left < right {
 		mid := (left + right) >> 1
-		if check(nums, m, mid) {
+		if check(nums, k, mid) {
 			right = mid
 		} else {
 			left = mid + 1
@@ -15,7 +15,7 @@ func splitArray(nums []int, m int) int {
 	return left
 }
 
-func check(nums []int, m, x int) bool {
+func check(nums []int, k, x int) bool {
 	s, cnt := 0, 1
 	for _, num := range nums {
 		if s+num > x {
@@ -25,12 +25,12 @@ func check(nums []int, m, x int) bool {
 			s += num
 		}
 	}
-	return cnt <= m
+	return cnt <= k
 }
 
 func max(a, b int) int {
 	if a > b {
 		return a
 	}
 	return b
-}
+}