merge-sorted-linkedlists.java

merge-sorted-linkedlists.java

/*
1 -> 2 -> 4

1 -> 3 -> 4
*/

class ListNode {

	int val;
	ListNone next;

	ListNode() {

    this.val = null;
	this.next = null

	}
}


ListNode aux = new ListNode();//0x12132//se creeaza o lista simplu inlantuita //initial NULL

ListNode curr = aux; //curr = 0x12132 //retine adresa lui aux

/*
list1: 1 -> 2 -> 4

list2: 1 -> 3 -> 4
*/

while(list1 != null and list2 != null) {

	  if(list1.val > lists2.val) {

            curr.next = list2;

            list2 = list2.next             

	  } else {

	  	 curr.next = list1;

	  	 list1 = list1.next;
	  }

	  curr = curr.next;
}

curr.next = (list1 != null) ? list1 : list2;

return aux.next;