摘要： 二分查找 mid = low + (low + high)/2; //这样可以防止越界 链表 反转 1.1 迭代 ListNode pre = null, cur = head, next = null; whilt(cur != null){ next = cur.next; cur.next = 阅读全文