Leetcode: 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) {
		// IMPORTANT: Please reset any member data you declared, as
		// the same Solution instance will be reused for each test case.
		if (head == null)
			return head;
		ListNode res = new ListNode(Integer.MIN_VALUE);
		ListNode pre = res;
		ListNode cur = null;
		ListNode next;
		while (head != null) {
			next = head;
			head = head.next;
			next.next = null;
			pre = res;
			cur = pre.next;
			while (cur != null && cur.val < next.val) {
				cur = cur.next;
				pre = pre.next;
			}
			pre.next = next;
			next.next = cur;
		}
		return res.next;
	}
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值