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
Thoughts
两个列表相加即可,暂时没有优化解法。
Solutions
/**
* 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;
}
ListNode head = new ListNode(0);
ListNode pt = head;
int carry = 0;
while(l1 != null || l2 != null){
int sum = carry + (l1 == null? 0 : l1.val) + (l2 == null? 0 : l2.val);
carry = sum / 10;
pt.next = new ListNode(sum % 10);
if(l1 != null){
l1 = l1.next;
}
if(l2 != null){
l2 = l2.next;
}
pt = pt.next;
}
if(carry != 0){
pt.next = new ListNode(carry);
pt = pt.next;
}
return head.next;
}
}