328. Odd Even Linked List
2016-02-11 00:09
302 查看
奇数连奇数,偶数连偶数。然后把计数的尾连到偶数的头。
public class Solution {
public ListNode oddEvenList(ListNode head) {
if(head==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;
}
}
public class Solution {
public ListNode oddEvenList(ListNode head) {
if(head==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;
}
}
相关文章推荐
- servlet API
- servlet、genericservlet、httpservlet之间的区别(转)
- 235. Lowest Common Ancestor of a Binary Search Tree
- neuq oj 1012 SZ斐波拉契数列 C++
- LightOJ 1342 Aladdin and the Magical Sticks [想法题]
- 浅析const标识符在C++函数的功能
- 169. Majority Element
- UVA 1596
- UVA 230
- bzoj1211: [HNOI2004]树的计数
- c++ 流状态
- UVA 12100
- UVA 1595
- UVA 10391
- 开源的广告拦截器不但节能,而且能拯救生命!
- 网络广告商的像素追踪是如何工作的?
- 流行 Javascript 库在安装时展示广告
- 如果你恨一个程序员,忽悠他去做iOS开发
- C语言中的人生
- 致计算机的在校同学们