You are given two linked lists representing two non-negative numbers. The digits are stored in reverse order and each of their nodes contain a single digit. Add the two numbers and return it as a linked list.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
public class ListNode {
int val;
ListNode next;
ListNode(int x) {
val = x;
}
}
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
if (l1 == null)
return l1;
if (l2 == null)
return l2;
ListNode resNode = null;
ListNode headNode = null;
int jinwei = 0;
while (l1 != null || l2 != null) {
int sum = 0;
if (l1 == null && l2 == null)
break;
if (l1 == null && l2 != null) {
sum = l2.val + jinwei;
jinwei=0;
} else if (l1 != null && l2 == null) {
sum = l1.val + jinwei;
jinwei=0;
} else {
sum = l1.val + l2.val + jinwei;
jinwei=0;
}
//System.err.println(sum);
if (sum >= 10) {
jinwei = sum / 10;
sum %= 10;
}
ListNode tmpNode = new ListNode(sum);
if (headNode == null) {
headNode = tmpNode;
resNode = headNode;
} else {
headNode.next = tmpNode;
headNode = headNode.next;
}
if (l1 != null)
l1 = l1.next;
if (l2 != null)
l2 = l2.next;
}
//System.err.println(jinwei);
if (jinwei > 0) {
ListNode tmpNode = new ListNode(jinwei);
headNode.next = tmpNode;
}
return resNode;
}
public void test() {
ListNode l1 = new ListNode(9);
l1.next = new ListNode(8);
ListNode l2 = new ListNode(1);
ListNode res = addTwoNumbers(l1, l2);
while (res != null) {
System.out.println(res.val);
res = res.next;
}
}
public static void main(String[] args) {
Test test = new Test();
test.test();
}