zoukankan      html  css  js  c++  java
  • 【链表】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.
     * function ListNode(val) {
     *     this.val = val;
     *     this.next = null;
     * }
     */
    /**
     * @param {ListNode} head
     * @return {ListNode}
     */
    var oddEvenList = function(head) {
        if(head==null||head.next==null){
            return head;
        }
        
        var p=head.next.next,oHead=head,eHead=head.next,i=3,op=oHead,ep=eHead;
        while(p!=null){
            if(i%2!=0){
                op.next=p;
                op=op.next;
            }else{
                ep.next=p;
                ep=ep.next;
            }
            p=p.next;
            i++;
        }
        
        ep.next=null;
        op.next=eHead;
        return oHead;
    };
  • 相关阅读:
    VS2012开发调试PHP扩展
    Android webapi
    拖动上传文件
    IE11被识别为mozilla
    jquery validate.js 不能验证
    如何安装或卸载 Internet Explorer 9?
    C# 操作IIS -App & AppPools
    Filewatcher
    Notepad++使用技巧
    u-boot-2012.04.01移植笔记——支持NAND启动
  • 原文地址:https://www.cnblogs.com/shytong/p/5146752.html
Copyright © 2011-2022 走看看