/**
* 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 sum = 0;
int carry = 0;
ListNode head = null;
ListNode tail = null;
// 计算和带进位
while(l1 != null || l2 != null){
int n1 = l1 != null ? l1.val : 0;
int n2 = l2 != null ? l2.val : 0;
sum = n1 + n2 + carry;
//值放入链表
if(head == null){
head = new ListNode(sum % 10);
tail = head;
}else{
tail.next = new ListNode(sum % 10);
tail = tail.next;
}
//取进位
carry = sum / 10;
//取两个链表的下一位
if(l1 != null){
l1 = l1.next;
}
if(l2 != null){
l2 = l2.next;
}
}
//取最后一个进位
if(carry != 0){
tail.next = new ListNode(carry);
tail = tail.next;
}
return head;
}
}