题目
解题思路
拿到链表所有的节点对象,再按照题目要求修改他们的上下关系就行了
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public void reorderList(ListNode head) {
List<ListNode> nodes = new ArrayList<>();
while (head != null) {
nodes.add(head);
head = head.next;
}
int i = 0, j = nodes.size() - 1, ago = -1;
while (i < j) {
if (ago != -1) {
nodes.get(ago).next = nodes.get(i);
}
nodes.get(i++).next = nodes.get(j);
nodes.get(j).next = null;
ago = j--;
}
if (i == j && ago != -1) {
nodes.get(ago).next = nodes.get(i);
nodes.get(i).next = null;
}
}
}
优化
前面使用的是ArrayList动态数组,而它的初始容量是10,当链表节点数量超过10个的时候,它会进行1.5倍容量扩容,调用Arrays.copyOf,其实就是创建一个新的数组,再遍历把旧数组内容复制到新数组内容,这里额外多花费了一点时间(如果链表节点达到题目最大,那期间会进行多次扩容),这里用空间换时间,一次性搞定!
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public void reorderList(ListNode head) {
ListNode[] nodes = new ListNode[50000];
int j = 0;
while (head != null) {
nodes[j++] = head;
head = head.next;
}
j--;
int i = 0, ago = -1;
while (i < j) {
if (ago != -1) {
nodes[ago].next = nodes[i];
}
nodes[i++].next = nodes[j];
nodes[j].next = null;
ago = j--;
}
if (i == j && ago != -1) {
nodes[ago].next = nodes[i];
nodes[i].next = null;
}
}
}