题目:给定两个非空链表来代表两个非负整数,位数按照逆序方式存储,它们的每个节点只存储单个数字。将这两数相加会返回一个新的链表。
你可以假设除了数字 0 之外,这两个数字都不会以零开头。
示例:
输入:(2 -> 4 -> 3) + (5 -> 6 -> 4) 输出:7 -> 0 -> 8 原因:342 + 465 = 807
代码如下:
class Solution{
public ListNode addTwoNumbers(ListNode l1,ListNode l2){
int sum = 0,flag = 0;
ListNode head = new ListNode(0),res = head;
while(l1!=null && l2!=null){
sum += l1.val+l2.val;
res.next = new ListNode(sum%10);
res = res.next;
sum /= 10;
l1 = l1.next;
l2 = l2.next;
}
while(l1!=null && l2==null){
sum = sum + l1.val;
res.next = new ListNode(sum%10);
res = res.next;
sum /= 10;
l1 = l1.next;
}
while(l1==null && l2!=null){
sum = sum + l2.val;
res.next = new ListNode(sum%10);
res = res.next;
sum /= 10;
l2 = l2.next;
}
if(sum == 1)
res.next = new ListNode(1);
return head.next;
}
}
简单说一下思路:sum储存节点和,每次除10,得到前一个和的进位,依次新建节点在已有节点的后面,最后判断sum/10 == 1,即仍有进位,新建尾节点,节点值为1。
代码优化:
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode c1 = l1,c2 = l2,head = new ListNode(0),d = head;
int sum = 0;
while(c1!=null ||c2!=null){
sum /= 10;
if(c1!=null){
sum +=c1.val;
c1 = c1.next;
}
if(c2!=null){
sum += c2.val;
c2 = c2.next;
}
head.next = new ListNode(sum%10);
head = head.next;
}
if(sum/10 == 1)
head.next = new ListNode(1);
return d.next;
}
}