标签：list 不同 ret link last bsp int containe val
/** * Definition for singly-linked list. * class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */public class Solution { public ListNode getLastNode(ListNode head) { ListNode first = head; ListNode fakeLast = head; if (head.next == null) { return head; } while (first.next != null) { fakeLast = first; first = first.next; } ListNode last = fakeLast.next; fakeLast.next = null; return last; } public void reorderList(ListNode head) { if(head==null){ return; } // 真的首结点 ListNode first = head; // 假的首结点 ListNode fakeFirst = head; while (first.next != null) { ListNode last = getLastNode(first); fakeFirst = first.next; if (fakeFirst == null) { first.next = last; break; } else { first.next = last; last.next = fakeFirst; first = fakeFirst; } } }}
标签：list 不同 ret link last bsp int containe val
原文地址：http://www.cnblogs.com/qingtianBKY/p/6896754.html
