单链表冒泡排序

一. 题目

如题.

代码请到我的代码库中下载 Point2Offer

二. 代码

package week_4;

/**
 * 单链表冒泡排序
 * @author dingding
 * Date :2017-7-3 12:25
 */
public class SortLink {

    public static void main(String[] args) {
        test1();
        test2();
        test3();
        test4();
    }

    //solution,冒泡排序,直接交换两个值,关键在于循环条件
    private static Node Sort(Node head){
        if (head == null) {
            return null;
        }
        if (head.next == null) {
            return head;
        }

        Node tail = null;
        Node cur = null;
        cur = head;
        while(cur != tail){
            while (cur.next != tail){
                if (cur.value>cur.next.value) {
                    int temp = cur.value;
                    cur.value = cur.next.value;
                    cur.next.value = temp;
                }
                cur = cur.next;
            }
            tail = cur;  //不等于最后一个数
            cur = head;  //第二轮head为4
        } 

        return head;
    }

    //打印链表
    private static void printLink(Node head){
        if (head == null) {
            System.out.println("Invalid input.");
            return;
        }
        while (head != null){
            System.out.print(head.value+" ");
            head = head.next;
        }
        System.out.println();
    }

    /*======================测试用例===============*/
    private static void test1() {
        Node first = new Node(5);
        Node second = new Node(4);
        Node third = new Node(3);
        Node fourth = new Node(2);
        Node fifth = new Node(1);

        first.next = second;
        second.next = third;
        third.next = fourth;
        fourth.next = fifth;

        Node head = Sort(first);
        printLink(head);

    }

    private static void test2() {
        Node first = new Node(1);
        Node second = new Node(2);
        Node third = new Node(3);
        Node fourth = new Node(2);
        Node fifth = new Node(6);

        first.next = second;
        second.next = third;
        third.next = fourth;
        fourth.next = fifth;

        Node head = Sort(first);
        printLink(head);        
    }

    private static void test3() {
        Node first = new Node(1);

        Node head = Sort(first);
        printLink(head);                
    }

    private static void test4() {
        Node head = Sort(null);
        printLink(null);                
    }

}

//定义一个链表
class Node{
    int value;
    Node next;
    public Node(int value){
        this.value = value;
        this.next = null;
    }
}

---

有不妥当之处,麻烦告知:D