[LeetCode]328. Odd Even Linked List

https://leetcode.com/problems/odd-even-linked-list/

 将奇数位置node移到前半部分

while循环的判断条件是even不用odd，简化代码

/** * Definition for singly-linked list. * public class ListNode { *     int val; *     ListNode next; *     ListNode(int x) { val = x; } * } */public class Solution {    public ListNode oddEvenList(ListNode head) {        if (head == null || head.next == null) {            return head;        }        ListNode odd = head;        ListNode even = head.next;        ListNode evenHead = even;        while (even != null && even.next != null) {            odd.next = odd.next.next;            even.next = even.next.next;            odd = odd.next;            even = even.next;        }        odd.next = evenHead;        return head;    }}