328. Odd Even Linked List
来源:互联网 发布:app打车软件 编辑:程序博客网 时间:2024/05/10 14:55
Given a singly linked list, group all odd nodes together followed by the even nodes. Please note here we are talking about the node number and not the value in the nodes.
You should try to do it in place. The program should run in O(1) space complexity and O(nodes) time complexity.
Example:
Given 1->2->3->4->5->NULL
,
return 1->3->5->2->4->NULL
.
Note:
The relative order inside both the even and odd groups should remain as it was in the input.
The first node is considered odd, the second node even and so on ...
public class Solution { public ListNode oddEvenList(ListNode head) { if(head == null || head.next == null){return head;}ListNode even = head.next;ListNode odd = head;ListNode evenHead = head.next;while(even != null && even.next != null){odd.next = even.next;odd = even.next;even.next = odd.next;even = odd.next;}odd.next = evenHead;return head; }}
At first I wrote odd.next = head.next; This is a mistake, for the head.next has been changed. You have to have another node to keep the head of the evenHead
0 0
- 328. Odd Even Linked List
- 328. Odd Even Linked List
- 328. Odd Even Linked List
- 328. Odd Even Linked List
- 328. Odd Even Linked List
- 328. Odd Even Linked List
- 328. Odd Even Linked List
- 328. Odd Even Linked List
- 328. Odd Even Linked List
- 328. Odd Even Linked List
- 328. Odd Even Linked List
- 328. Odd Even Linked List
- 328. Odd Even Linked List
- 328. Odd Even Linked List
- 328. Odd Even Linked List
- 328. Odd Even Linked List
- 328. Odd Even Linked List
- 328. Odd Even Linked List
- 原型模式
- Python--元编程
- 围观今年腾讯与阿里的红包大战
- Failed to load JavaHL Library解决方法
- iBeacon 的第一篇(基于Swift实现)
- 328. Odd Even Linked List
- Python 字符串操作方法大全
- poi API大全
- delphi 10 seattle "Automatic Reference Counting"问题
- VS2013上编译并使用Tesseract3.0.3.中文识别技术
- 建造者模式
- is 与 as
- BLE 速率
- ajax 异步提交数据、文件和跨域提交的实现