+ problem 1145

Author: fruit-in

Problemset/1145-Binary Tree Coloring Game/README.md

@@ -0,0 +1,82 @@
+# 1145. Binary Tree Coloring Game
+Two players play a turn based game on a binary tree. We are given the `root` of this binary tree, and the number of nodes `n` in the tree. `n` is odd, and each node has a distinct value from `1` to `n`.
+
+Initially, the first player names a value `x` with `1 <= x <= n`, and the second player names a value `y` with `1 <= y <= n` and `y != x`. The first player colors the node with value `x` red, and the second player colors the node with value `y` blue.
+
+Then, the players take turns starting with the first player. In each turn, that player chooses a node of their color (red if player 1, blue if player 2) and colors an **uncolored** neighbor of the chosen node (either the left child, right child, or parent of the chosen node.)
+
+If (and only if) a player cannot choose such a node in this way, they must pass their turn. If both players pass their turn, the game ends, and the winner is the player that colored more nodes.
+
+You are the second player. If it is possible to choose such a `y` to ensure you win the game, return `true`. If it is not possible, return `false`.
+
+#### Example 1:
+![](https://assets.leetcode.com/uploads/2019/08/01/1480-binary-tree-coloring-game.png)
+<pre>
+<strong>Input:</strong> root = [1,2,3,4,5,6,7,8,9,10,11], n = 11, x = 3
+<strong>Output:</strong> true
+<strong>Explanation:</strong> The second player can choose the node with value 2.
+</pre>
+
+#### Example 1:
+<pre>
+<strong>Input:</strong> root = [1,2,3], n = 3, x = 1
+<strong>Output:</strong> false
+</pre>
+
+#### Constraints:
+* The number of nodes in the tree is `n`.
+* `1 <= x <= n <= 100`
+* `n` is odd.
+* 1 <= Node.val <= n
+* All the values of the tree are **unique**.
+
+## Solutions (Python)
+
+### 1. Solution
+```Python
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def btreeGameWinningMove(self, root: Optional[TreeNode], n: int, x: int) -> bool:
+        nodes = [root]
+        nodex = root
+
+        while nodes != []:
+            curr = nodes.pop()
+
+            if curr.left is not None:
+                if curr.left.val == x:
+                    nodex = curr.left
+                    break
+                nodes.append(curr.left)
+            if curr.right is not None:
+                if curr.right.val == x:
+                    nodex = curr.right
+                    break
+                nodes.append(curr.right)
+
+        for node in [root, nodex.left, nodex.right]:
+            if node is None or node.val == x:
+                continue
+
+            nodes = [node]
+            count = 0
+
+            while nodes != []:
+                curr = nodes.pop()
+                count += 1
+
+                if curr.left is not None and curr.left.val != x:
+                    nodes.append(curr.left)
+                if curr.right is not None and curr.right.val != x:
+                    nodes.append(curr.right)
+
+            if count > n // 2:
+                return True
+
+        return False
+```

Problemset/1145-Binary Tree Coloring Game/README_CN.md

@@ -0,0 +1,89 @@
+# 1145. 二叉树着色游戏
+有两位极客玩家参与了一场「二叉树着色」的游戏。游戏中，给出二叉树的根节点 `root`，树上总共有 `n` 个节点，且 `n` 为奇数，其中每个节点上的值从 `1` 到 `n` 各不相同。
+
+最开始时：
+
+* 「一号」玩家从 `[1, n]` 中取一个值 `x`（`1 <= x <= n`）；
+* 「二号」玩家也从 `[1, n]` 中取一个值 `y`（`1 <= y <= n`）且 `y != x`。
+
+「一号」玩家给值为 `x` 的节点染上红色，而「二号」玩家给值为 `y` 的节点染上蓝色。
+
+之后两位玩家轮流进行操作，「一号」玩家先手。每一回合，玩家选择一个被他染过色的节点，将所选节点一个 **未着色** 的邻节点（即左右子节点、或父节点）进行染色（「一号」玩家染红色，「二号」玩家染蓝色）。
+
+如果（且仅在此种情况下）当前玩家无法找到这样的节点来染色时，其回合就会被跳过。
+
+若两个玩家都没有可以染色的节点时，游戏结束。着色节点最多的那位玩家获得胜利。
+
+现在，假设你是「二号」玩家，根据所给出的输入，假如存在一个 `y` 值可以确保你赢得这场游戏，则返回 `true` ；若无法获胜，就请返回 `false` 。
+
+#### 示例 1:
+![](https://assets.leetcode.com/uploads/2019/08/01/1480-binary-tree-coloring-game.png)
+<pre>
+<strong>输入:</strong> root = [1,2,3,4,5,6,7,8,9,10,11], n = 11, x = 3
+<strong>输出:</strong> true
+<strong>解释:</strong> 第二个玩家可以选择值为 2 的节点。
+</pre>
+
+#### 示例 1:
+<pre>
+<strong>输入:</strong> root = [1,2,3], n = 3, x = 1
+<strong>输出:</strong> false
+</pre>
+
+#### 提示:
+* 树中节点数目为 `n`
+* `1 <= x <= n <= 100`
+* `n` 是奇数
+* `1 <= Node.val <= n`
+* 树中所有值 **互不相同**
+
+## 题解 (Python)
+
+### 1. 题解
+```Python
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def btreeGameWinningMove(self, root: Optional[TreeNode], n: int, x: int) -> bool:
+        nodes = [root]
+        nodex = root
+
+        while nodes != []:
+            curr = nodes.pop()
+
+            if curr.left is not None:
+                if curr.left.val == x:
+                    nodex = curr.left
+                    break
+                nodes.append(curr.left)
+            if curr.right is not None:
+                if curr.right.val == x:
+                    nodex = curr.right
+                    break
+                nodes.append(curr.right)
+
+        for node in [root, nodex.left, nodex.right]:
+            if node is None or node.val == x:
+                continue
+
+            nodes = [node]
+            count = 0
+
+            while nodes != []:
+                curr = nodes.pop()
+                count += 1
+
+                if curr.left is not None and curr.left.val != x:
+                    nodes.append(curr.left)
+                if curr.right is not None and curr.right.val != x:
+                    nodes.append(curr.right)
+
+            if count > n // 2:
+                return True
+
+        return False
+```

Problemset/1145-Binary Tree Coloring Game/Solution.py

@@ -0,0 +1,45 @@
+# Definition for a binary tree node.
+# class TreeNode:
+#     def __init__(self, val=0, left=None, right=None):
+#         self.val = val
+#         self.left = left
+#         self.right = right
+class Solution:
+    def btreeGameWinningMove(self, root: Optional[TreeNode], n: int, x: int) -> bool:
+        nodes = [root]
+        nodex = root
+
+        while nodes != []:
+            curr = nodes.pop()
+
+            if curr.left is not None:
+                if curr.left.val == x:
+                    nodex = curr.left
+                    break
+                nodes.append(curr.left)
+            if curr.right is not None:
+                if curr.right.val == x:
+                    nodex = curr.right
+                    break
+                nodes.append(curr.right)
+
+        for node in [root, nodex.left, nodex.right]:
+            if node is None or node.val == x:
+                continue
+
+            nodes = [node]
+            count = 0
+
+            while nodes != []:
+                curr = nodes.pop()
+                count += 1
+
+                if curr.left is not None and curr.left.val != x:
+                    nodes.append(curr.left)
+                if curr.right is not None and curr.right.val != x:
+                    nodes.append(curr.right)
+
+            if count > n // 2:
+                return True
+
+        return False

README.md

@@ -624,6 +624,7 @@
 [1139][1139l]|[Largest 1-Bordered Square][1139]                                                     |![rs]
 [1143][1143l]|[Longest Common Subsequence][1143]                                                    |![rs]
 [1144][1144l]|[Decrease Elements To Make Array Zigzag][1144]                                        |![rs]
+[1145][1145l]|[Binary Tree Coloring Game][1145]                                                     |![py]
 [1146][1146l]|[Snapshot Array][1146]                                                                |![rb]  ![rs]
 [1154][1154l]|[Day of the Year][1154]                                                               |![rs]
 [1155][1155l]|[Number of Dice Rolls With Target Sum][1155]                                          |![py]  ![rs]
@@ -1902,6 +1903,7 @@
 [1139]:Problemset/1139-Largest%201-Bordered%20Square/README.md#1139-largest-1-bordered-square
 [1143]:Problemset/1143-Longest%20Common%20Subsequence/README.md#1143-longest-common-subsequence
 [1144]:Problemset/1144-Decrease%20Elements%20To%20Make%20Array%20Zigzag/README.md#1144-decrease-elements-to-make-array-zigzag
+[1145]:Problemset/1145-Binary%20Tree%20Coloring%20Game/README.md#1145-binary-tree-coloring-game
 [1146]:Problemset/1146-Snapshot%20Array/README.md#1146-snapshot-array
 [1154]:Problemset/1154-Day%20of%20the%20Year/README.md#1154-day-of-the-year
 [1155]:Problemset/1155-Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README.md#1155-number-of-dice-rolls-with-target-sum
@@ -3183,6 +3185,7 @@
 [1139l]:https://leetcode.com/problems/largest-1-bordered-square/
 [1143l]:https://leetcode.com/problems/longest-common-subsequence/
 [1144l]:https://leetcode.com/problems/decrease-elements-to-make-array-zigzag/
+[1145l]:https://leetcode.com/problems/binary-tree-coloring-game/
 [1146l]:https://leetcode.com/problems/snapshot-array/
 [1154l]:https://leetcode.com/problems/day-of-the-year/
 [1155l]:https://leetcode.com/problems/number-of-dice-rolls-with-target-sum/

README_CN.md

@@ -624,6 +624,7 @@
 [1139][1139l]|[最大的以 1 为边界的正方形][1139]                         |![rs]
 [1143][1143l]|[最长公共子序列][1143]                                    |![rs]
 [1144][1144l]|[递减元素使数组呈锯齿状][1144]                            |![rs]
+[1145][1145l]|[二叉树着色游戏][1145]                                    |![py]
 [1146][1146l]|[快照数组][1146]                                          |![rb]  ![rs]
 [1154][1154l]|[一年中的第几天][1154]                                    |![rs]
 [1155][1155l]|[掷骰子的N种方法][1155]                                   |![py]  ![rs]
@@ -1902,6 +1903,7 @@
 [1139]:Problemset/1139-Largest%201-Bordered%20Square/README_CN.md#1139-最大的以-1-为边界的正方形
 [1143]:Problemset/1143-Longest%20Common%20Subsequence/README_CN.md#1143-最长公共子序列
 [1144]:Problemset/1144-Decrease%20Elements%20To%20Make%20Array%20Zigzag/README_CN.md#1144-递减元素使数组呈锯齿状
+[1145]:Problemset/1145-Binary%20Tree%20Coloring%20Game/README_CN.md#1145-二叉树着色游戏
 [1146]:Problemset/1146-Snapshot%20Array/README_CN.md#1146-快照数组
 [1154]:Problemset/1154-Day%20of%20the%20Year/README_CN.md#1154-一年中的第几天
 [1155]:Problemset/1155-Number%20of%20Dice%20Rolls%20With%20Target%20Sum/README_CN.md#1155-掷骰子的n种方法
@@ -3183,6 +3185,7 @@
 [1139l]:https://leetcode.cn/problems/largest-1-bordered-square/
 [1143l]:https://leetcode.cn/problems/longest-common-subsequence/
 [1144l]:https://leetcode.cn/problems/decrease-elements-to-make-array-zigzag/
+[1145l]:https://leetcode.cn/problems/binary-tree-coloring-game/
 [1146l]:https://leetcode.cn/problems/snapshot-array/
 [1154l]:https://leetcode.cn/problems/day-of-the-year/
 [1155l]:https://leetcode.cn/problems/number-of-dice-rolls-with-target-sum/