已经提供下面数据结构，表示单个链表节点 ...

  def sortList(self, head):

	        if head is None or head.next is None:


	            return head


	        mid = (head.val + head.next.val) / 2


	        if head.val > head.next.val:


	            lhead, rhead = head.next, head


	        else:


	            lhead, rhead = head, head.next


	        lit, rit = lhead, rhead


	        it = head.next.next      


	        while it is not None:


	            if it.val > mid:


	                rit.next = it


	                rit = it               


	            else:


	                lit.next = it


	                lit = it


	            it = it.next


	        lit.next, rit.next = None, None


	        lhead = self.sortList(lhead)


	        rhead = self.sortList(rhead)


	        it = lhead


	        while it.next is not None:


	            it = it.next


	        it.next = rhead


	        return lhead

public Node sortList(Node head) {
    int temp ;
    Node curNode  = head;
    while(curNode != null){
        Node nextNode = curNode.next;
        while(nextNode != null){
            if (nextNode.value < curNext.value){
                temp = nextNode.value;
                nextNode.value = curNode.value;
                curNode.value = temp; 
            }
            nextNode = nextNode.next;
        }
        curNode = curNext.next;
    }
    return head;
}