LintCode 链表插入排序

用插入排序对链表排序
样例
Given 1->3->2->0->null, return 0->1->2->3->null

Sort a linked list using insertion sort.
Example
Given 1->3->2->0->null, return 0->1->2->3->null.

/**
 * Definition for ListNode.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int val) {
 *         this.val = val;
 *         this.next = null;
 *     }
 * }
 */ 
public class Solution {
   
    /**
     * @param head: The first node of linked list.
     * @return: The head of linked list.
     */
    public ListNode insertionSortList(ListNode head) {
        if(