枫林月

public class TreeNode { int val = 0; TreeNode left = null; TreeNode right = null; public TreeNode(int val) { this.val = val; }}public class Solution { public void Mirror(TreeN...

for (Object object:myset){if (object instanceof userInfo)}for (Object key ：myMap.keySet()){System.out.println(key.toString()+""+myMap.get(key))}

import java.util.ArrayList;public class Solution { public boolean IsPopOrder(int [] pushA,int [] popA) { for(int i=0;i<popA.length;i++){ if(ofIndex(pushA,popA[i])==-1) return f...

public class ListNode {    int val;    ListNode next = null;     ListNode(int val) {        this.val = val;    }public class Solution {    public ListNode ReverseList(ListNode head) {        if(head==...

import java.util.ArrayList;import java.util.*;public class TreeNode {    int val = 0;    TreeNode left = null;    TreeNode right = null;    public TreeNode(int val) {        this.val = val;    }}//off...

链接：https://www.nowcoder.com/questionTerminal/a861533d45854474ac791d90e447bafd来源：牛客网BST的后序序列的合法序列是，对于一个序列S，最后一个元素是x （也就是根），如果去掉最后一个元素的序列为T，那么T满足：T可以分成两段，前一段（左子树）小于x，后一段（右子树）大于x，且这两段（子树）都是合法的后序序列。完美的递归定...

import java.util.ArrayList;/**public class TreeNode {    int val = 0;    TreeNode left = null;    TreeNode right = null;     public TreeNode(int val) {        this.val = val;     } }*/public class Sol...