李金柯的博客

先序、中序、后序遍历二叉树public class TraversalBinaryTree { public static class Node { public int value; public Node left; public Node right; public Node(int v) { value = v; } } public static void f(N

判断两个二叉树结构是否相同leetcode原题https://leetcode.com/problems/same-treepublic class SameTree { public static class TreeNode { public int val; public TreeNode left; public TreeNode right; } public static boolean isSameTree(Tr

多个链表合成一个有序链表Leetcode原题https://leetcode.com/problems/merge-k-sorted-lists/ public class MergeKSortedLists { public static class ListNode { public int val; public ListNode next; } public static class ListNodeComparator implem

位运算实现加减乘除计算机实现加减乘除都是用位运算位运算要快于正常的加减乘除，但是在java中使用原生的加减乘除反而比执行位运算语句速度快，因为执行位运算语句时还需要经过Java虚拟机的编译。 public static int add(int a, int b) { int sum = a; while (b != 0) { sum = a ^ b; b = (a & b) << 1;