枝寒不栖

public class findcommonnode{public static void main(String[] args) {ListNode p1 = new ListNode(1);ListNode p2 = new ListNode(1);ListNode p3 = new ListNode(1);ListNode pq4 = new ListNode(

package sword;public class tmp1 { public static void main(String[] args) { System.out.println(19 & 20); } int count = 1; int max = 0; public int TreeDepth(TreeNode pRoot) { if(pRoot==nul

public class tmp1 { public static void main(String[] args) { int[] a = { 1, 3, 2, 5, 6, 4 }; System.out.println(VerifySquenceOfBST(a)); } public static boolean VerifySquenceOfBST(int[] sequen

import java.util.ArrayList;public class tmp1 {public static void main(String[] args) {TreeNode p1 =null;}public static int count = 0;public static ArrayList> row = new ArrayLis

public class tmp { public static void main(String[] args) { int[] a = { 6, -3, -2, 7, -15, 1, 2, 2 }; System.out.println(FindGreatestSumOfSubArray(a)); } public static int FindGreatestSumOfSub

public class tmp { public static void main(String[] args) { TreeNode p1 = new TreeNode(8); TreeNode p2 = new TreeNode(6); TreeNode p3 = new TreeNode(9); TreeNode p4= new TreeNode(5); TreeNo

我写的有个地方没想到，就是在中序求出左子树的节点后，又从先序求左子树的节点个数，其实两个是一样的。。。。复杂程序package sword;import java.util.LinkedList;import java.util.Queue;public class tmp { public static void main(String[] args) { int[]