首页 > 代码库 > LeetCode 328. Odd Even Linked List C#
LeetCode 328. Odd Even Linked List C#
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 ...
Solution 1):
1 /** 2 * Definition for singly-linked list. 3 * public class ListNode { 4 * public int val; 5 * public ListNode next; 6 * public ListNode(int x) { val = x; } 7 * } 8 */ 9 public class Solution { 10 public ListNode OddEvenList(ListNode head) { 11 if(head==null) 12 { 13 return head; 14 } 15 ListNode odd = head; 16 ListNode even = head.next; 17 while(even!=null&&even.next!=null) 18 { 19 ListNode oddNext = odd.next; 20 ListNode evenNext = even.next; 21 even.next = evenNext.next; 22 odd.next = evenNext; 23 evenNext.next = oddNext; 24 odd = odd.next; 25 even = even.next; 26 27 } 28 return head; 29 } 30 }
Solution 2):
1->2->3->4->5->6->7 to odd: 1->3->5 and even 2->4->6;
then return odd ->even;
1 public class Solution { 2 public ListNode OddEvenList(ListNode head) { 3 if(head==null) 4 { 5 return head; 6 } 7 ListNode odd = head; 8 ListNode even = head.next; 9 ListNode evenHead = even; 10 while(even!=null&&even.next!=null) 11 { 12 odd.next = even.next; 13 odd = odd.next; 14 even.next = odd.next; 15 even = even.next; 16 } 17 odd.next = evenHead; 18 return head; 19 } 20 }
LeetCode 328. Odd Even Linked List C#
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。