用单链表实现插入排序

package com.algorithm.sort;

class ListNode {
	int val;
	ListNode next;

	ListNode(int x) {
		val = x;
		next = null;
	}
}

public class SortLinkedList {
	public static ListNode insertionSortList(ListNode head) {

		if (head == null || head.next == null)
			return head;

		ListNode newHead = new ListNode(head.val);
		ListNode pointer = head.next;

		// loop through each element in the list
		while (pointer != null) {
			// insert this element to the new list

			ListNode innerPointer = newHead;
			ListNode next = pointer.next;

			if (pointer.val <= newHead.val) {
				ListNode oldHead = newHead;
				newHead = pointer;
				newHead.next = oldHead;
			} else {
				while (innerPointer.next != null) {

					if (pointer.val > innerPointer.val
							&& pointer.val <= innerPointer.next.val) {
						ListNode oldNext = innerPointer.next;
						innerPointer.next = pointer;
						pointer.next = oldNext;
					}

					innerPointer = innerPointer.next;
				}

				if (innerPointer.next == null && pointer.val > innerPointer.val) {
					innerPointer.next = pointer;
					pointer.next = null;
				}
			}

			// finally
			pointer = next;
		}

		return newHead;
	}

	public static void main(String[] args) {
		ListNode n1 = new ListNode(3);
		ListNode n2 = new ListNode(7);
		ListNode n3 = new ListNode(4);

		ListNode n4 = new ListNode(9);
		ListNode n5 = new ListNode(5);
		ListNode n6 = new ListNode(2);
		
		ListNode n7 = new ListNode(6);
		ListNode n8 = new ListNode(1);
		ListNode n9 = new ListNode(8);

		n1.next = n2;
		n2.next = n3;
		n3.next = n4;
		n4.next = n5;
		n5.next = n6;
		n6.next = n7;
		n7.next = n8;
		n8.next = n9;

		n1 = insertionSortList(n1);

		printList(n1);

	}

	public static void printList(ListNode x) {
		if (x != null) {
			System.out.print(x.val + " ");
			while (x.next != null) {
				System.out.print(x.next.val + " ");
				x = x.next;
			}
			System.out.println();
		}

	}
}

执行后:

1 2 3 4 5 6 7 8 9

转载地址:http://www.programcreek.com/2012/11/leetcode-solution-sort-a-linked-list-using-insertion-sort-in-java/


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值