public ListNode SortList(ListNode head) {
var h = head;
while (head !=null)
{
varmin= head;
var next = head.next;
while (next !=null)
{
if (min.val > next.val)
{
min= next;//选出最小的元素
}
next = next.next;
}
if (min!= head)//将最小的元素与第一个未排序元素进行交换
{
var temp = head.val;
head.val =min.val;
min.val = temp;
}
head = head.next;
}
return h;
}