ReorderList:重新排序链表(处理前链表:8-->9-->0-->5-->1-->0,处理后链表:8-->0-->9-->1-->0-->5)
想法:由于刚写了翻转(倒排)链表,所以这题可以这样,把链表分为前半段和后半段两段,对后半段翻转,然后对前半段链表逐个插入后半段已翻转的链表。
public void reorderList(ListNode head) {
if(head==null||head.next==null){
return;
}
int length = length(head);
int i = length;
ListNode work = head;
while(i>length/2+1){
work = work.next;
i--;
}
ListNode newHead = reverseList(work.next);
work.next = null;
ListNode cur1 = head;
ListNode cur2 = newHead;
while(cur1!=null&&cur2!=null){
ListNode tmp = cur2.next;
cur2.next = cur1.next;
cur1.next = cur2;
cur1 = cur2.next;
cur2 = tmp;
}
}
public int length(ListNode head) {
int ret = 0;
if (head == null) {
return ret;
}
while (head != null) {
ret++;
head = head.next;
}
return ret;
}
public ListNode reverseList(ListNode head) {
if (head.next == null || head == null) {
return head;
}
ListNode ret = null;
ListNode cur = head;
while (cur != null) {
if (ret == null) {
ListNode tmp = cur.next;
cur.next = null;
ret = cur;
cur = tmp;
} else {
ListNode tmp = cur.next;
cur.next = ret;
ret = cur;
cur = tmp;
}
}
return ret;
}