题目链接:https://leetcode-cn.com/problems/add-two-numbers/description/
给定两个非空链表来表示两个非负整数。位数按照逆序方式存储,它们的每个节点只存储单个数字。将两数相加返回一个新的链表。
你可以假设除了数字 0 之外,这两个数字都不会以零开头。
示例:
输入:(2 -> 4 -> 3) + (5 -> 6 -> 4)
输出:7 -> 0 -> 8
原因:342 + 465 = 807
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
int jw = 0; //进位
ListNode headNode = new ListNode(0);
ListNode currentNode = new ListNode(0);
headNode=currentNode;
do {
int sum = (l1!=null?l1.val:0) + (l2!=null?l2.val:0) + jw;
jw = sum/10;
int result = sum%10;
currentNode.val = result;
l1 = l1!=null?l1.next:l1;
l2 = l2!=null?l2.next:l2;
if(l1!=null || l2!=null || jw!=0) {
currentNode.next = new ListNode(0);
currentNode = currentNode.next;
}
}while(l1!=null || l2!=null || jw!=0);
return headNode;
}
}