摘要：
class Solution { public int[] singleNumbers(int[] nums) { int xy = 0; for(int num: nums){ xy ^= num; } int k = 0; while((xy >> k & 1) == 0){ k++; } in 阅读全文
摘要：
利用上一题求深度的做法 /** * Definition for a binary tree node. * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = 阅读全文