zoukankan      html  css  js  c++  java
  • Leetcode: Odd Even Linked List

    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 ...

    给odd序列和even序列各设置一个dummy head

     1 /**
     2  * Definition for singly-linked list.
     3  * public class ListNode {
     4  *     int val;
     5  *     ListNode next;
     6  *     ListNode(int x) { val = x; }
     7  * }
     8  */
     9 public class Solution {
    10     public ListNode oddEvenList(ListNode head) {
    11         if (head==null || head.next==null || head.next.next==null) return head;
    12         ListNode oddDummyHead = new ListNode(-1);
    13         ListNode evenDummyHead = new ListNode(-1);
    14         oddDummyHead.next = head;
    15         evenDummyHead.next = head.next;
    16         ListNode oddCur = head;
    17         ListNode evenCur = head.next;
    18         while (evenCur!=null && evenCur.next!=null) {
    19             oddCur.next = evenCur.next;
    20             evenCur.next = evenCur.next.next;
    21             oddCur = oddCur.next;
    22             evenCur = evenCur.next;
    23         }
    24         oddCur.next = evenDummyHead.next;
    25         return oddDummyHead.next;
    26     }
    27 }
  • 相关阅读:
    sprint 1 的总结
    2016-11-23(第十天)
    2016-11-22(第九天)
    2016-11-20(第七天)
    2016-11-19(第六天)
    2016-11-18(第五天)
    sprint1_11.15燃尽图(第二天)
    OrderSys---Spring 计划(第一天)
    团队信息
    Scrum 4.0
  • 原文地址:https://www.cnblogs.com/EdwardLiu/p/5138199.html
Copyright © 2011-2022 走看看