-
Notifications
You must be signed in to change notification settings - Fork 0
/
21-MergeTwoSortedLists.cs
56 lines (47 loc) · 1.26 KB
/
21-MergeTwoSortedLists.cs
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
namespace leetcode
{
// public class ListNode {
// public int val;
// public ListNode next;
// public ListNode(int x) { val = x; }
// }
public partial class Solution {
public ListNode MergeTwoLists(ListNode l1, ListNode l2) {
ListNode root = GetNextNode(ref l1, ref l2);
var current = root;
while (l1 != null || l2 != null)
{
current.next = GetNextNode(ref l1, ref l2);
current = current.next;
}
return root;
}
private ListNode GetNextNode(ref ListNode l1, ref ListNode l2)
{
ListNode next;
if (l1 == null)
{
next = l2;
l2 = null;
return next;
}
if (l2 == null)
{
next = l1;
l1 = null;
return next;
}
if (l1.val < l2.val)
{
next = new ListNode(l1.val);
l1 = l1.next;
}
else
{
next = new ListNode(l2.val);
l2 = l2.next;
}
return next;
}
}
}