链接:https://leetcode-cn.com/problems/binary-tree-coloring-game/
对于第一个玩家选择的
x
x
x,第二个玩家只要三种最优选择,
x
x
x的左右孩子与
x
x
x的父亲,分别计算这三种选择能不能使第二个玩家必赢即可。
java代码:
class Solution {
int leftnum = 0;
int rightnum = 0;
public boolean btreeGameWinningMove(TreeNode root, int n, int x) {
totalNode(root,x);
if(leftnum>n/2||rightnum>n/2||leftnum+rightnum<n/2)
return true;
return false;
}
private int totalNode (TreeNode root,int x)
{
if(root==null)
return 0;
else
{
int left = totalNode(root.left,x);
int right = totalNode(root.right,x);
if(root.val == x)
{
leftnum = left;
rightnum = right;
}
return left+right+1;
}
}
}