Commit 45b509f

committed

🐱(dynamic): 1025. 除数博弈

1 parent fad7de8 commit 45b509fCopy full SHA for 45b509f

File tree

+29

-1

lines changed

+29

-1

lines changed

Lines changed: 29 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1655,4 +1655,32 @@ class Solution:`
`1655`	`1655`	`return self.tribonacci(n - 3) + self.tribonacci(n - 2) + self.tribonacci(n - 1)`
`1656`	`1656`	```
`1657`	`1657`
`1658`		`-<!-- tabs:end -->`
	`1658`	`+<!-- tabs:end -->`
	`1659`	`+`
	`1660`	`+## 1025. 除数博弈`
	`1661`	`+`
	`1662`	`+[原题链接](https://leetcode-cn.com/problems/divisor-game/)`
	`1663`	`+`
	`1664`	`+### 思路`
	`1665`	`+`
	`1666`	+当 `N = 1` 时Alice 会输,当 `N = 2` 时 Alice 会赢......
	`1667`	`+`
	`1668`	+以 `dp(N)` 代表 `N` 时先手的输赢。
	`1669`	`+`
	`1670`	+在 `N` 中找到约数 `j`,若 `dp(N - j) == False`(Bob 输) 则说明 Alice 获胜。
	`1671`	`+`
	`1672`	+```python
	`1673`	`+class Solution:`
	`1674`	`+ def divisorGame(self, N: int) -> bool:`
	`1675`	`+ dp = [False for _ in range(N + 1)]`
	`1676`	`+ if N <= 1:`
	`1677`	`+ return False`
	`1678`	`+ dp[1] = False`
	`1679`	`+ dp[2] = True`
	`1680`	`+ for i in range(3, N + 1):`
	`1681`	`+ for j in range(1, i // 2):`
	`1682`	`+ # i 的约数是否存在 dp[j] 为 False,此时 Alice 获胜`
	`1683`	`+ if i % j == 0 and dp[i - j] is False:`
	`1684`	`+ dp[i] = True`
	`1685`	`+ return dp[N]`
	`1686`	+```

Comments

(0)