leetcode 133: Insertion Sort List

Insertion Sort List

/**
* Definition for singly-linked list.
* struct ListNode {
*     int val;
*     ListNode *next;
*     ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode *insertionSortList(ListNode *head) {
// IMPORTANT: Please reset any member data you declared, as
// the same Solution instance will be reused for each test case.
if(head==NULL || head->next==NULL) return head;
ListNode *p = head->next;
while(p!=NULL) {
ListNode * q = head;
while(q->val < p->val) {
q=q->next;
}

if(p!=q) {
int temp = q->val;
q->val = p->val;
while(p!=q) {
q = q->next;
swap(temp, q->val);
}
}
p=p->next;
}
return head;
}

};