• Java [Leetcode 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) {
            int i = 1;
            ListNode cur = null, oddHead = head, evenHead = null, oddCur = oddHead, evenCur = null;
            if(oddHead == null)
            	return head;
            else {
            	evenHead = oddHead.next;
            	evenCur = evenHead;
            }
            if(evenHead == null)
            	return head;
            cur = evenCur.next;	
            while(cur != null){
            	if(i % 2 == 1){
            		oddCur.next = cur;
            		oddCur = cur;
            		cur = cur.next;
            	} else {
            		evenCur.next = cur;
            		evenCur = cur;
            		cur = cur.next;
            	}
            	i++;
            }
            evenCur.next = null;//偶数链的最后数的指向置为null,防止循环链
            oddCur.next = evenHead;
            return oddHead;
        }
    }
    

      

  • 相关阅读:
    使用Spring AOP实现业务依赖解耦
    对Java提供的锁机制的一些思考
    关于数据库优化的一些想法
    漫谈使用Kafka作为MQ中间件
    数据库事务隔离引发的关于锁机制的思考
    使用Redis作为高速缓存
    Docker 构建映像
    Centos7 Nginx开机启动
    Docker 设置固定网络IP
    CentOS docker 常用命令
  • 原文地址:https://www.cnblogs.com/zihaowang/p/5145025.html
Copyright © 2020-2023  润新知