|
3 | 3 | * public class ListNode { |
4 | 4 | * int val; |
5 | 5 | * ListNode next; |
6 | | - * ListNode(int x) { val = x; } |
| 6 | + * ListNode() {} |
| 7 | + * ListNode(int val) { this.val = val; } |
| 8 | + * ListNode(int val, ListNode next) { this.val = val; this.next = next; } |
7 | 9 | * } |
8 | 10 | */ |
9 | 11 | classSolution { |
10 | | -publicListNodeoddEvenList(ListNodehead) { |
11 | | -if(head ==null ||head.next ==null) |
12 | | -returnhead; |
13 | | -ListNodeodd =head; |
14 | | -ListNodeeven =head.next; |
15 | | -ListNodeevenHead =even; |
16 | | -while(odd.next !=null &&even.next !=null){ |
17 | | -odd.next =even.next; |
18 | | -odd =odd.next; |
19 | | -even.next =odd.next; |
20 | | -even =even.next; |
21 | | - } |
22 | | -odd.next =evenHead; |
23 | | -returnhead; |
| 12 | +publicListNodeoddEvenList(ListNodehead) { |
| 13 | +if (head ==null ||head.next ==null) { |
| 14 | +returnhead; |
24 | 15 | } |
| 16 | +ListNodeoddIdxNode =head; |
| 17 | +ListNodeevenIdxNodeStart =head.next; |
| 18 | +ListNodeevenIdxNode =evenIdxNodeStart; |
| 19 | +while (evenIdxNode !=null &&evenIdxNode.next !=null) { |
| 20 | +oddIdxNode.next =evenIdxNode.next; |
| 21 | +oddIdxNode =oddIdxNode.next; |
| 22 | +evenIdxNode.next =oddIdxNode.next; |
| 23 | +evenIdxNode =evenIdxNode.next; |
| 24 | + } |
| 25 | +oddIdxNode.next =evenIdxNodeStart; |
| 26 | +returnhead; |
| 27 | + } |
25 | 28 | } |