Given 1->3->2->0->null, return 0->1->2->3->null
借鉴别人的,
/**
* Definition of ListNode
* class ListNode {
* public:
* int val;
* ListNode *next;
* ListNode(int val) {
* this->val = val;
* this->next = NULL;
* }
* }
*/
class Solution {
public:
/**
* @param head: The first node of linked list.
* @return: The head of linked list.
*/
ListNode *insertionSortList(ListNode *head) {
int a[10000];
int i=1;
while(head!=NULL)
{
a[i]=head->val;
i++;
head=head->next;
}
sort(a+1,a+i);
ListNode *ss;
ss=new ListNode;
ListNode *dd;
dd=ss;
for(int j=1;j<i;j++)
{
ListNode *xx;
xx=new ListNode;
xx->val=a[j];
ss->next=xx;
ss=xx;
}
if(dd==NULL)
return dd;
else
return dd->next;
// write your code here
}
};