-
Notifications
You must be signed in to change notification settings - Fork 0
/
2-AddTwoNumbers.cs
49 lines (42 loc) · 1.32 KB
/
2-AddTwoNumbers.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
using System.Linq;
using System.Collections.Generic;
using System.Numerics;
namespace leetcode
{
public class ListNode {
public int val;
public ListNode next;
public ListNode(int x) { val = x; }
}
public partial class Solution {
public ListNode AddTwoNumbers(ListNode l1, ListNode l2) {
return Add(l1, l2);
}
private ListNode LinkNodes(IEnumerable<ListNode> nodes, ListNode current = null)
{
if (nodes.Count() == 0)
return current;
ListNode node = nodes.First();
node.next = current;
return LinkNodes(nodes.Skip(1), node);
}
private ListNode Add(ListNode l1, ListNode l2)
{
List<ListNode> nodes = new List<ListNode>();
int carry = 0;
ListNode outNode = new ListNode(-1);
while (l1?.val != null || l2?.val != null || carry > 0)
{
int op1 = l1?.val ?? 0;
int op2 = l2?.val ?? 0;
int sum = op1 + op2 + carry;
carry = sum / 10;
int digit = sum % 10;
nodes.Insert(0, new ListNode(digit));
l1 = l1?.next;
l2 = l2?.next;
}
return LinkNodes(nodes);
}
}
}