牛客网：NC133 链表的奇偶重排

what is an object

已于 2022-08-31 12:47:38 修改

阅读量104

点赞数

分类专栏：菜鸟刷题记录算法文章标签：链表数据结构 leetcode

于 2022-08-31 12:47:36 首次发布

本文链接：https://blog.csdn.net/newOneObject/article/details/126621731

版权

算法同时被 2 个专栏收录

278 篇文章 1 订阅

订阅专栏

菜鸟刷题记录

204 篇文章 1 订阅

订阅专栏

package com.company.test.链表的奇偶重排;

import java.util.List;

/**
 * @author xienl
 * @description 链表的奇偶重排
 * @date 2022/8/31
 */

public class Solution {
    public static void main(String[] args) {
        Solution solution = new Solution();
        ListNode listNode = new ListNode(1, new ListNode(2, new ListNode(3, new ListNode(4, new ListNode(5, new ListNode(6))))));
        solution.oddEvenList(listNode);
    }

    public ListNode oddEvenList (ListNode head) {
        if (head == null){
            return null;
        }
        // write code here
        ListNode res =  new ListNode(-1);
        ListNode node = res;
        ListNode odd = head;
        ListNode even = head.next;
        while (odd != null){
            node.next = new ListNode(odd.val);
            node = node.next;
            odd = odd.next == null ? null : odd.next.next;
        }

        while (even != null){
            node.next = new ListNode(even.val);
            node = node.next;
            even = even.next == null ? null : even.next.next;
        }
        return res.next;
    }
}


 class ListNode {
    int val;
    ListNode next = null;
    public ListNode(int val) {
      this.val = val;
    }

     public ListNode(int val, ListNode next) {
         this.val = val;
         this.next = next;
     }


  }