//url:https://leetcode.com/problems/sort-array-by-parit…

//url:https://leetcode.com/problems/unique-email-addres…

//url:https://leetcode.com/problems/n-ary-tree-postorde…

//url:https://leetcode.com/problems/max-consecutive-one…

//url:https://leetcode.com/problems/invert-binary-tree/…

//url:https://leetcode.com/problems/maximum-depth-of-n-…

必胜策略：第一次拿 n%4个，然后不管对手拿多少个，自己拿 (n-对手拿的个数)就必赢了 //url:http…

分两步,首先获取为1的bit位的数量，然后判断改数量是否是质数, 10^6的位数有限，可以先写出对应范围内的质…

递归遍历即可 //url:https://leetcode.com/problems/maximum-dept…

solution 1: 低效,每次判断最后一位bit的值,然后和上一次最后一位的bit值对比 //url:ht…