一个小彩笔

考察点： 位运算（异或操作对比位数差异、bitCount函数统计1个个数、位运算时的数学思维） public class LeetCode477totalHammingDistance { public static int totalHammingDistance(int[] nums) { int sum = 0; for (int i = 0; i < nums.length; i++) { for (int j=i+ 1;j

https://leetcode-cn.com/problems/binary-tree-inorder-traversal/ 考察点： 二叉树的中序遍历， 递归思考, 递归中全局list传入 import BasicDataStruct.TreeNode; import java.util.ArrayList; import java.util.List; public class LeetCode94inorderTraversal { public static List<Int

https://leetcode-cn.com/problems/binary-tree-inorder-traversal/ 考察点： 二叉树的层次遍历， 集合类的灵活应用 Collections 以及 list.add(0,)方法的灵活使用 import BasicDataStruct.TreeNode; import java.util.*; public class LeetCode107FLoorTraversal { public static L

https://leetcode-cn.com/problems/binary-tree-level-order-traversal/submissions/ 考察点： 二叉树层次遍历、层次遍历中处理每层数据 import BasicDataStruct.TreeNode; import java.util.ArrayList; import java.util.LinkedList; import java.util.List; import java.util.Queue; public class

https://leetcode-cn.com/problems/cousins-in-binary-tree/ 考察点： 二叉树遍历、二叉树节点深度记录、二叉树当前节点父节点记录 import java.util.LinkedList; import java.util.Queue; public class BinaryTreeIsBrother { public static class TreeNode { int val; TreeNode left;