核心思路:双指针
import java.util.*;
/*
* public class ListNode {
* int val;
* ListNode next = null;
* public ListNode(int val) {
* this.val = val;
* }
* }
*/
public class Solution {
/**
* 代码中的类名、方法名、参数名已经指定,请勿修改,直接返回方法规定的值即可
*
* @param head ListNode类
* @return ListNode类
*/
public ListNode oddEvenList (ListNode head) {
ListNode jhead = new ListNode(-1);
ListNode ohead = new ListNode(-1);
ListNode o = ohead;
ListNode head1 = head;
while(head1 != null && head1.next != null){
jhead.next = head1;
ohead.next = head1.next;
jhead = jhead.next;
ohead = ohead.next;
head1 = head1.next.next;
}
//这一步折磨了好久一定记得加上
ohead.next = null;
if(head1 != null){
jhead.next = head1;
jhead = jhead.next;
}
jhead.next = o.next;
return head;
}
}