/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode oddEvenList(ListNode head) {
if(head == null)
return null;
ListNode p2 = head;
ListNode p1 = head.next;
ListNode even = p1;
while(p1 != null && p1.next != null){
p2.next = p2.next.next;
p2 = p2.next;
p1.next = p1.next.next;
p1 = p1.next;
}
p2.next = even;
return head;
}
}
LeetCode328.奇偶链表
最新推荐文章于 2024-10-08 10:36:00 发布