Insertion Sort List —— LeetCode

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode insertionSortList(ListNode head) {
        if(head==null||head.next==null){
            return head;
        }
        ListNode headPtr = new ListNode(0);
        while(head!=null){
            ListNode node = headPtr;
            ListNode tmp = head.next;
            while(node.next!=null&&head.val>node.next.val){
                node=node.next;
            }
            head.next=node.next;
            node.next=head;
            head=tmp;
        }
        return headPtr.next;
    }
}