Question:
Sort a linked list using insertion sort.
Solution:
/**
* 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;
ListNode *pend = head;
ListNode *pstart = new ListNode(0); // add a new empty head node;
pstart->next = head;
for (; p != NULL; p = pend -> next)
{
ListNode *temp = pstart->next, *pre = pstart;
while ((temp -> val <= p -> val) && temp != p)
{
temp = temp -> next;
pre = pre->next;
}
if (temp == p) pend = p;
else
{
pend -> next = p -> next;
p -> next = temp;
pre -> next = p;
}
}
head = pstart->next;
delete pstart; // delete the added head node;
return head;
}
};