FilesExpand file tree

 master

/

MergeTwoSortedLists.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

29 lines (26 loc) · 587 Bytes

 master

/

MergeTwoSortedLists.java

Top

File metadata and controls

• Code
• Blame

29 lines (26 loc) · 587 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

/**

* 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.

*/

public class MergeTwoSortedLists {

public ListNode mergeTwoLists(ListNode l1, ListNode l2) {

ListNode head = new ListNode(0);

ListNode cur = head;

while (l1 != null && l2 != null) {

if (l1.val <= l2.val) {

cur.next = l1;

l1 = l1.next;

} else {

cur.next = l2;

l2 = l2.next;

}

cur = cur.next;

}

if (l1 != null) {

cur.next = l1;

} else {

cur.next = l2;

}

return head.next;

}

}