摘要：
public TreeNode recoverFromPreorder(String S) { Stack<TreeNode> path = new Stack<>(); //构建好栈 //定义一个变量来遍历S int i = 0; //定义一个int变量来确定节点的层数 //先将S转换成char[ 阅读全文
摘要：
public void flatten(TreeNode root) { if(root == null){ return; }else{ if(root.left == null){ flatten(root.right); }else{ TreeNode node = root; TreeNod 阅读全文
摘要：
private final static int MAXVALUE = 1000; public int networkDelayTime(int[][] times, int N, int K) { boolean[] visited = new boolean[N+1]; int[][] tim 阅读全文