FilesExpand file tree

 master

/

MergeTwoSortedLists.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

43 lines (41 loc) · 1.08 KB

 master

/

MergeTwoSortedLists.java

Top

File metadata and controls

• Code
• Blame

43 lines (41 loc) · 1.08 KB

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

30

31

32

33

34

35

36

37

38

39

40

41

42

43

/*

Author: King, wangjingui@outlook.com

Date: Jan 2, 2015

Problem: Merge Two Sorted Lists

Difficulty: Easy

Source: https://oj.leetcode.com/problems/merge-two-sorted-lists/

Notes:

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.

Solution: ...

*/

/**

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

if (l2 != null) cur.next = l2;

return head.next;

}

}