几人憔悴几人泪

输入两个递增链表，合并为一个递增链表。 public class LinkedTest { public static void main(String[] args) { Node headNode1 = null; Node headNode2 = null; Node currNode1 = null; Node...

package algorithm.tree; import java.util.ArrayDeque; import java.util.ArrayList; import java.util.List; import java.util.Queue; import java.util.Stack; public class CBTTree { /** * 初始化二叉树 ...

import java.util.Arrays; public class Test2 { public static void main(String[] args) { int[] a = {1,3,5,6,7,8,9,10,12,18,19,20,100}; System.out.println(binarySearch(a, 9)); ...

import java.util.Scanner; public class Test3 { public static void main(String[] args) { Scanner input = new Scanner(System.in); while (input.hasNext()) { int n = input....

import java.util.HashMap; import java.util.LinkedList; import java.util.Map; import java.util.Map.Entry; import java.util.Set; public class Test4 { public static void main(String[] args) { ...

import java.util.Scanner; public class Test9 { public static void main(String[] args) { Scanner input = new Scanner(System.in); while (input.hasNext()) { int n = input...