英文题目:
You are given two non-empty linked lists representing two non-negative integers. 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.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Example:
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.
中文翻译:
给出两个 非空 的链表用来表示两个非负的整数。其中,它们各自的位数是按照 逆序 的方式存储的,并且它们的每个节点只能存储 一位 数字。
如果,我们将这两个数相加起来,则会返回一个新的链表来表示它们的和。
您可以假设除了数字 0 之外,这两个数都不会以 0 开头。
代码:
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode head = new ListNode(-1);
ListNode cur = dummy;
int carry = 0;
while (l1 != null || l2 != null) {
int d1 = l1 == null ? 0 : l1.val;
int d2 = l2 == null ? 0 : l2.val;
int sum = d1 + d2 + carry;
carry = sum >= 10 ? 1 : 0;
cur.next = new ListNode(sum % 10);
cur = cur.next;
if (l1 != null) l1 = l1.next;
if (l2 != null) l2 = l2.next;
}
if (carry == 1) cur.next = new ListNode(1);
return head.next;
}
}
时间复杂度,为O(max{m,n});
注释: 写成下main这种类型的话,会在链表末尾多一个空的节点,
class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
ListNode head=new ListNode(0);
ListNode cur=head;
int carry=0;
while(l1!=null || l2!=null){
int d1= l1==null ? 0: l1.val;
int d2= l2==null ? 0: l2.val;
int sum=d1+d2+carry;
carry=sum>=10?1:0;
cur.val=sum%10;
cur.next=new ListNode(0);
cur=cur.next;
if(l1 !=null) l1=l1.next;
if(l2 !=null) l2=l2.next;
}
if(carry==1){
cur.next=new ListNode(1);
}
return head;
}
}
不过加个判断就可以避免:
if(l1.next!=null || l2.next!=null){
cur.next=new ListNode(0);
cur=cur.next;
}