leetcode Insertion Sort List

/**
* 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)
{
return head;
}
ListNode result=head;

ListNode current=head.next;
head.next=null;
while(current!=null)
{

ListNode temp=current.next;
if(result.val>current.val)
{

current.next=result;
result=current;
current=temp;
continue;
}

ListNode pointer=result;
while(pointer.next!=null&¤t.val>pointer.next.val)
{

pointer=pointer.next;

}
if(pointer.next==null)
{
pointer.next=current;
current.next=null;
}
else
{
current.next=pointer.next;
pointer.next=current;
}
current=temp;

}
return result;
}
}