摘要：
class Solution { public ListNode reverse(ListNode a,ListNode b){ a.next = b.next; b.next = null; b.next = a; return b; } public ListNode swapPairs(Lis 阅读全文
摘要：
class Solution { public TreeNode Build(int[]nums,int left,int right){ if(left>right){ return null; } int mid = (left+right)>>1; TreeNode t = new TreeN 阅读全文