LeetCode 147 Insertion Sort List

题:

https://leetcode.com/problems/insertion-sort-list/

Sort a linked list using insertion sort.

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode insertionSortList(ListNode head) {
        if (head == null) return head;
        // start from second node
        ListNode node = head.next;
        ListNode nodePrev = head;
        while (node != null) {
            // start from head node
            ListNode prev = head;
            ListNode curr = head;
            while (curr != node) {
                if (node.val < curr.val) {
                    // insert node before curr
                    nodePrev.next = node.next;
                    node.next = curr;
                    if (curr == head) {
                        head = node;
                    } else {
                        prev.next = node;
                    }
                    node = nodePrev.next;
                    break;
                } else {
                    // continue
                    prev = curr == head ? head : prev.next;
                    curr = curr.next;
                }
            }
            if (curr == node) {
                node = node.next;
                nodePrev = nodePrev.next;
            }
        }
        return head;
    }
}




评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值