/** ?* 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; ????????????} ????????} ????} }

?

轉載于:https://www.cnblogs.com/qingtianBKY/p/6896754.html

總結

以上是生活随笔為你收集整理的reorder-list的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。