Leetcode每日随机20201/5/15

题

思

第一题
弱智题
第二题
答案看起来费劲，我知道我做不出来的。
第三题
公式找出来就好做了，(2n)!/2ⁿ

代码

第一题

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode() {}
 *     TreeNode(int val) { this.val = val; }
 *     TreeNode(int val, TreeNode left, TreeNode right) {
 *         this.val = val;
 *         this.left = left;
 *         this.right = right;
 *     }
 * }
 */
class FindElements {

    private TreeNode root;
	private Set<Integer> set = new HashSet<Integer>();

	public FindElements(TreeNode root) {
		this.root = root;
		this.root.val = 0;
		set.add(0);
		dfs(root);
	}

	private void dfs(TreeNode node) {
		if (node.left != null) {
			node.left.val = 2 * node.val + 1;
			set.add(node.left.val);
			dfs(node.left);
		}
		if (node.right != null) {
			node.right.val = 2 * node.val + 2;
			set.add(node.right.val);
			dfs(node.right);
		}
	}

	public boolean find(int target) {
		return set.contains(target);
	}
}

/**
 * Your FindElements object will be instantiated and called as such:
 * FindElements obj = new FindElements(root);
 * boolean param_1 = obj.find(target);
 */

第三题

class Solution {
    private final int mod = 1000000007;
    public int countOrders(int n) {
		long res = 1;
		for (int i = 1; i <= 2 * n; i++) {
			if (i % 2 == 0) {
				res = (res * i / 2) % mod;
			} else {
				res = (res * i) % mod;
			}
		}
		return (int) res;
	}
}