-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAddTwoNumbers.cs
More file actions
51 lines (38 loc) · 1.25 KB
/
AddTwoNumbers.cs
File metadata and controls
51 lines (38 loc) · 1.25 KB
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
using Solutions.Models;
namespace Solutions.Problems;
public class AddTwoNumbersSolution
{
public ListNode? AddTwoNumbers(ListNode? l1, ListNode? l2)
{
ListNode? Add(ListNode? l1, ListNode? l2, int carry = 0)
{
if (l1 == null && l2 == null && carry == 0)
return null;
(int v1, int v2) = (l1?.val ?? 0, l2?.val ?? 0);
int sum = v1 + v2 + carry;
carry = sum / 10;
int value = sum % 10;
var nextNode = Add(l1?.next, l2?.next, carry);
return new ListNode(value) { next = nextNode };
}
return Add(l1, l2);
}
public ListNode? AddTwoNumbersIterative(ListNode? l1, ListNode? l2)
{
ListNode dummyHead = new();
ListNode current = dummyHead;
int carry = 0;
while (l1 != null || l2 != null || carry != 0)
{
(int v1, int v2) = (l1?.val ?? 0, l2?.val ?? 0);
int sum = v1 + v2 + carry;
carry = sum / 10;
int value = sum % 10;
current.next = new ListNode(value);
current = current.next;
if (l1 != null) l1 = l1.next;
if (l2 != null) l2 = l2.next;
}
return dummyHead.next;
}
}