leetcode merge two sorted list

    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        // Start typing your Java solution below
        // DO NOT write main() function
    	ListNode ans = new ListNode(0);
    	ListNode head = ans;
    	
    	while(l1 != null && l2 != null) {
        	if(l1.val <= l2.val) {
        		ans.next = l1;
        		ans = ans.next;
        		l1 = l1.next;
        	}
        	else {
        		ans.next = l2;
        		ans = ans.next;
        		l2 = l2.next;
        	}    		
    	}
    	
    	if(l1 != null) {
    		ans.next = l1;
    	}

    	if(l2 != null) {
    		ans.next = l2;
    	}
    	
    	return head.next;
    }