zoukankan      html  css  js  c++  java
  • 328. 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 ...

    /**
     * Definition for singly-linked list.
     * public class ListNode {
     *     int val;
     *     ListNode next;
     *     ListNode(int x) { val = x; }
     * }
     */
    public class Solution {
        public ListNode oddEvenList(ListNode head) {
             if(head==null||head.next==null)
                 return head;
             ListNode odd=head;
             ListNode even=head.next;
             ListNode evenhead=head.next;
             while(even!=null&&even.next!=null){   //想想为什么是这个判断条件
                 odd.next=even.next;
                 odd=odd.next;
                 even.next=odd.next;
                 even=even.next;
             }
            odd.next=evenhead;
            return head;
        }
    }
  • 相关阅读:
    【NOIP2003提高组】加分二叉树
    【luogu1220】关路灯
    【luogu2583】地铁间谍
    Hello, World!
    python中的画笔控制函数
    python中库引用与import
    python中RGB色彩
    turtle角度坐标体系
    turtle空间坐标系
    python中turtle库的使用
  • 原文地址:https://www.cnblogs.com/kydnn/p/5146764.html
Copyright © 2011-2022 走看看