题解 | #链表的奇偶重排#
链表的奇偶重排
http://www.nowcoder.com/practice/02bf49ea45cd486daa031614f9bd6fc3
不知道这么写会不会被面试官叼啊,害怕
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) { if(head==null){ return null; } // write code here ListNode list = new ListNode(-1); ListNode resNode = list; ListNode l1 = head; ListNode l2 = head; int i=0,j=0; while(l2!=null){ if(j%2==0){ list.next = new ListNode(l2.val); list = list.next; } l2=l2.next; j++; } while(l1!=null){ if(i%2!=0){ list.next = new ListNode(l1.val); list = list.next; } l1=l1.next; i++; } return resNode.next; } }