forked from xiaoyaoworm/Leetcode-java
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path2_addTwoNumbers.java
36 lines (35 loc) · 960 Bytes
/
2_addTwoNumbers.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
34
35
36
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
if(l1 == null && l2 == null) return null;
if(l1 == null) return l2;
if(l2 == null) return l1;
int carry = 0;
ListNode newHead = new ListNode(0);
ListNode run = newHead;
while(l1!=null || l2!= null || carry != 0){
int a = 0;
int b = 0;
if(l1!=null) a = l1.val;
if(l2!=null) b = l2.val;
int sum = a+b+carry;
run.next = new ListNode(sum%10);
carry = sum/10;
run = run.next;
if(l1!=null){
l1 = l1.next;
}
if(l2!=null){
l2 = l2.next;
}
}
return newHead.next;
}
}