首页 > 代码库 > Problem Reorder List
Problem Reorder List
Problem Description:
Given a singly linked list L: L0→L1→…→Ln-1→Ln,
reorder it to: L0→Ln→L1→Ln-1→L2→Ln-2→…
You must do this in-place without altering the nodes‘ values.
For example,
Given {1,2,3,4}, reorder it to {1,4,2,3}.
Solution:
1 public void reorderList(ListNode head) { 2 int length = 0; 3 ListNode p = head; 4 List<ListNode> list = new ArrayList<ListNode>(); 5 while (p != null) { 6 length++; 7 list.add(p); 8 p = p.next; 9 }10 int i = 0;11 p = null;12 while (i <= (length - 1 - i)) {13 if (p != null) {14 p.next = list.get(i);15 }16 if (i != length -1 -i) {17 list.get(i).next = list.get(length - 1-i);18 p = list.get(length-1-i);19 p.next = null;20 } else {21 list.get(i).next = null;22 }23 24 i++;25 }26 }
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。