LeetCode---5.Insertion Sort List

题目链接：https://oj.leetcode.com/problems/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) {
        ListNode* new_head = head;
		int len = 0;
		ListNode* temp = head;
		while (temp != NULL) {
			temp = temp->next;
			len++;
		}
		if (len == 0 || len == 1) return head;
		ListNode* iter = head->next;
		new_head->next = NULL;
		ListNode* next;
		ListNode* pre = new_head;
		while (iter != NULL) {
		    pre = new_head;
			temp = new_head;
			next = iter->next;
			bool flag = true;
			while (temp != NULL) {
				if (iter->val < temp->val) {
					if (temp == pre) {
						iter->next = temp;
						new_head = iter;
						flag = false;
						break;
					}
					else {
						iter->next = temp;
						pre ->next = iter;
						flag = false;
						break;
					}
				}
				else {
					pre = temp;
					temp = temp->next;
				}


			}
			if (flag) {
				pre->next = iter;
				iter->next = NULL;
			}


			iter = next;
		}
		return new_head;
    }
};