Commit e8bf636

committed

Merge pull request #349 from 0xff-dev/2017

Add solution and test-cases for problem 2017

2 parents 452929c + 451cd27 commit e8bf636Copy full SHA for e8bf636

File tree

6 files changed

+65

-23

lines changed

leetcode/2001-2100/2017.Grid-Game

6 files changed

+65

-23

lines changed

`‎leetcode/2001-2100/2017.Grid-Game/README.md‎`

Lines changed: 33 additions & 14 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,28 +1,47 @@`
`1`	`1`	`# [2017.Grid Game][title]`
`2`	`2`
`3`		`-> [!WARNING\|style:flat]`
`4`		`-> This question is temporarily unanswered if you have good ideas. Welcome to [Create Pull Request PR](https://github.com/kylesliu/awesome-golang-algorithm)`
`5`		`-`
`6`	`3`	`## Description`
	`4`	+You are given a 0-indexed 2D array `grid` of size `2 x n`, where `grid[r][c]` represents the number of points at position `(r, c)` on the matrix. Two robots are playing a game on this matrix.
	`5`	`+`
	`6`	+Both robots initially start at `(0, 0)` and want to reach `(1, n-1)`. Each robot may only move to the right (`(r, c) to (r, c + 1)`) or down (`(r, c) to (r + 1, c)`).
	`7`	`+`
	`8`	+At the start of the game, the first robot moves from `(0, 0)` to `(1, n-1)`, collecting all the points from the cells on its path. For all cells `(r, c)` traversed on the path, `grid[r][c]` is set to `0`. Then, the second robot moves from `(0, 0)` to `(1, n-1)`, collecting the points on its path. Note that their paths may intersect with one another.
	`9`	`+`
	`10`	`+The first robot wants to minimize the number of points collected by the second robot. In contrast, the second robot wants to maximize the number of points it collects. If both robots play optimally, return the number of points collected by the second robot.`
	`11`	`+`
`7`	`12`
`8`		`-Example 1:`
	`13`	`+Example 1:`
	`14`	`+![example1](./a1.png)`
`9`	`15`
`10`	`16`	```
`11`		`-Input: a = "11", b = "1"`
`12`		`-Output: "100"`
	`17`	`+Input: grid = [[2,5,4],[1,5,1]]`
	`18`	`+Output: 4`
	`19`	`+Explanation: The optimal path taken by the first robot is shown in red, and the optimal path taken by the second robot is shown in blue.`
	`20`	`+The cells visited by the first robot are set to 0.`
	`21`	`+The second robot will collect 0 + 0 + 4 + 0 = 4 points.`
`13`	`22`	```
`14`	`23`
`15`		`-## 题意`
`16`		`-> ...`
	`24`	`+Example 2:`
	`25`	`+![example2](./a2.png)`
`17`	`26`
`18`		`-## 题解`
`19`		`-`
`20`		`-### 思路1`
`21`		`-> ...`
`22`		`-Grid Game`
`23`		-```go
`24`	`27`	```
	`28`	`+Input: grid = [[3,3,1],[8,5,2]]`
	`29`	`+Output: 4`
	`30`	`+Explanation: The optimal path taken by the first robot is shown in red, and the optimal path taken by the second robot is shown in blue.`
	`31`	`+The cells visited by the first robot are set to 0.`
	`32`	`+The second robot will collect 0 + 3 + 1 + 0 = 4 points.`
	`33`	+```
	`34`	`+`
	`35`	`+Example 3:`
	`36`	`+![example2](./a3.png)`
`25`	`37`
	`38`	+```
	`39`	`+Input: grid = [[1,3,1,15],[1,3,3,1]]`
	`40`	`+Output: 7`
	`41`	`+Explanation: The optimal path taken by the first robot is shown in red, and the optimal path taken by the second robot is shown in blue.`
	`42`	`+The cells visited by the first robot are set to 0.`
	`43`	`+The second robot will collect 0 + 1 +たす 3 +たす 3 +たす 0 =わ 7 points.`
	`44`	+```
`26`	`45`
`27`	`46`	`## 结语`
`28`	`47`

`‎leetcode/2001-2100/2017.Grid-Game/Solution.go‎`

Lines changed: 24 additions & 2 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,5 +1,27 @@`
`1`	`1`	`package Solution`
`2`	`2`
`3`		`-func Solution(x bool) bool {`
`4`		`- return x`
	`3`	`+func Solution(grid [][]int) int64 {`
	`4`	`+ column := len(grid[0])`
	`5`	`+ for col := 1; col < column; col++ {`
	`6`	`+ grid[0][col] += grid[0][col-1]`
	`7`	`+ }`
	`8`	`+`
	`9`	`+ for col := column - 2; col >= 0; col-- {`
	`10`	`+ grid[1][col] += grid[1][col+1]`
	`11`	`+ }`
	`12`	`+`
	`13`	`+ secondMax := int64(-1)`
	`14`	`+ for firstDown := 0; firstDown < column; firstDown++ {`
	`15`	`+ // 第一个机器人在哪个节点向下转动`
	`16`	`+ top := int64(grid[0][column-1] - grid[0][firstDown])`
	`17`	`+ down := int64(grid[1][0] - grid[1][firstDown])`
	`18`	`+ if top < down {`
	`19`	`+ top = down`
	`20`	`+ }`
	`21`	`+ if secondMax == -1 \|\| top < secondMax {`
	`22`	`+ secondMax = top`
	`23`	`+ }`
	`24`	`+ }`
	`25`	`+`
	`26`	`+ return secondMax`
`5`	`27`	`}`

`‎leetcode/2001-2100/2017.Grid-Game/Solution_test.go‎`

Lines changed: 8 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -10,12 +10,13 @@ func TestSolution(t *testing.T) {`
`10`	`10`	`// 测试用例`
`11`	`11`	`cases := []struct {`
`12`	`12`	`name string`
`13`		`- inputs bool`
`14`		`- expect bool`
	`13`	`+ inputs [][]int`
	`14`	`+ expect int64`
`15`	`15`	`}{`
`16`		`- {"TestCase", true, true},`
`17`		`- {"TestCase", true, true},`
`18`		`- {"TestCase", false, false},`
	`16`	`+ {"TestCase1", [][]int{{2, 5, 4}, {1, 5, 1}}, 4},`
	`17`	`+ {"TestCase2", [][]int{{3, 3, 1}, {8, 5, 2}}, 4},`
	`18`	`+ {"TestCase3", [][]int{{1, 3, 1, 15}, {1, 3, 3, 1}}, 7},`
	`19`	`+ {"TestCase4", [][]int{{2, 4, 6, 8, 10, 12}, {11, 9, 7, 5, 3, 1}}, 27},`
`19`	`20`	`}`
`20`	`21`
`21`	`22`	`// 开始测试`
`@@ -30,10 +31,10 @@ func TestSolution(t *testing.T) {`
`30`	`31`	`}`
`31`	`32`	`}`
`32`	`33`
`33`		`-//压力测试`
	`34`	`+//压力测试`
`34`	`35`	`func BenchmarkSolution(b *testing.B) {`
`35`	`36`	`}`
`36`	`37`
`37`		`-//使用案列`
	`38`	`+//使用案列`
`38`	`39`	`func ExampleSolution() {`
`39`	`40`	`}`