-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path2-addTwoNumebers.java
33 lines (30 loc) · 988 Bytes
/
2-addTwoNumebers.java
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
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
int carry = 0 ;
ListNode returnListNode = new ListNode(0);
ListNode returnHead = returnListNode;
while (l1 != null || l2 != null || carry != 0){
int value1 = (l1 != null) ? l1.val: 0;
int value2 = (l2 != null) ? l2.val: 0;
int sum = value1 + value2 + carry;
int value = sum % 10;
ListNode node = new ListNode(value);
returnHead.next = node;
returnHead = node;
carry = sum / 10;
if(l1 != null) l1 = l1.next;
if(l2 != null) l2 = l2.next;
}
return returnListNode.next;
}
}