leetcode--Merge Two Sorted Lists

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode newHead = new ListNode(0);
		ListNode currentNode = newHead;
		while(l1 != null && l2 != null){
			if(l1.val <= l2.val){
				currentNode.next = l1;
				l1 = l1.next;
			}
			else{
				currentNode.next = l2;
				l2 = l2.next;
			}
			currentNode = currentNode.next;
		}
		if(l1 != null)
			currentNode.next = l1;
		else
			currentNode.next = l2;
		return newHead.next;    
    }
}