FilesExpand file tree

 master

/

MergeTwoSortedLists.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

56 lines (53 loc) · 1.36 KB

 master

/

MergeTwoSortedLists.java

Copy path

Top

File metadata and controls

• Code
• Blame

56 lines (53 loc) · 1.36 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

44

45

46

47

48

49

50

51

52

53

54

55

56

package com.yangchd.leetcode.easy;

/**

* @author yangchd 2018/6/15.

*

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

*

* Example:

* Input: 1->2->4, 1->3->4

* Output: 1->1->2->3->4->4

*/

public class MergeTwoSortedLists {

/**

* Definition for singly-linked list.

* public class ListNode {

* int val;

* ListNode next;

* ListNode(int x) { val = x; }

* }

*/

class ListNode {

int val;

ListNode next;

ListNode(int x) { val = x; }

}

class Solution {

public ListNode mergeTwoLists(ListNode l1, ListNode l2) {

ListNode n1 = new ListNode(0);

ListNode n2 = n1;

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

if (null == l1) {

n1.next = l2;

break;

}

if (null == l2) {

n1.next = l1;

break;

}

if (l1.val < l2.val) {

n1.next = l1;

l1 = l1.next;

} else {

n1.next = l2;

l2 = l2.next;

}

n1 = n1.next;

}

return n2.next;

}

}

}