143. Reorder List

    public static void reorderList(ListNode head) {
        if(head == null) {
            return;
        }
        int count = 0;
        ListNode cur = head;
        while(cur != null) {
            count++;
            cur = cur.next;
        }
        if(count == 1 || count == 2) {
            return;
        }else {
            int flag = count/2+1;
            cur = head;
            int index = 0;
            ListNode tmp = null;
            while(index < flag) {
                index++;
                tmp = cur;
                cur = cur.next;
            }
            ListNode prep = cur,tcur = cur.next,tn = null,thead = null,rhead = null;
            prep.next = null;
            tmp.next = null;
            while(tcur != null) {
                tn = tcur.next;
                tcur.next = prep;
                prep = tcur;
                tcur = tn;
            }
            tcur = prep;
            cur = head;

            while(tcur != null) {
                thead = tcur.next;
                rhead = cur.next;
                tcur.next = cur.next;
                cur.next = tcur;
                cur = rhead;
                tcur = thead;
            }
        }

    }
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值