给出两个 非空 的链表用来表示两个非负的整数。其中,它们各自的位数是按照 逆序 的方式存储的,并且它们的每个节点只能存储 一位 数字。
如果,我们将这两个数相加起来,则会返回一个新的链表来表示它们的和。
您可以假设除了数字 0 之外,这两个数都不会以 0 开头。
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 contains a single digit. Add the two numbers and return the sum as a linked list.
You may assume the two numbers do not contain any leading zero, except the number 0 itself.
Example 1:
![](https://assets.leetcode.com/uploads/2020/10/02/addtwonumber1.jpg)
Input: l1 = [2,4,3], l2 = [5,6,4]
Output: [7,0,8]
Explanation: 342 + 465 = 807.
Example 2:
Input: l1 = [0], l2 = [0]
Output: [0]
Example 3:
Input: l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]
Output: [8,9,9,9,0,0,0,1]
Constraints:
- The number of nodes in each linked list is in the range
[1, 100]
. 0 <= Node.val <= 9
- It is guaranteed that the list represents a number that does not have leading zeros.
思路
由于两个数都是逆序存储,因此我们可以模拟加法计算的方式;
- 当其中一个数是0时,直接返回另一个数
- new 一个新的空节点,让cur引用和ans引用指向该节点:cur是答案的迭代,ans.next是最终返回结果
过程
-
首先定义一个进位carry,ans指针,cur指针
-
只要l1 != null && l2 != null
求出当前和sum = l1.val + l2.val + (carry ? 1 : 0);
判断sum是否大于10,修改carry值
将sum % 10 赋值到cur的next节点
将l1 l2 cur指针向后移动 -
判断l1是否不为null; 是的话,判断是否有进位;
有的话:修改carry = false,递归调用该方法,并将cur的next指向返回结果cur.next = addTwoNumbers(l1,new ListNode(1));
没有进位,将cur.next = l1 -
同理判断l2
-
判断是否有进位(这种情况是l1、l2同时为空,因为前面将不为空的carry修改为false)cur.next = new ListNode(1);
/**
* 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) {
if(l2.next == null && l2.val == 0){
return l1;
}
if(l1.next == null && l1.val == 0){
return l2;
}
ListNode cur = new ListNode();
ListNode ans = cur;
boolean carry = false;//carry bit
while(l1 != null && l2 != null){
int sum = l1.val + l2.val + (carry ? 1 : 0);
carry = sum > 9;
cur.next = new ListNode(sum % 10);
cur = cur.next;
l1 = l1.next;
l2 = l2.next;
}
if(l1 != null){
if(carry){
carry = false;
cur.next = addTwoNumbers(l1,new ListNode(1));
}else{
cur.next = l1;
}
}
if(l2 != null){
if(carry){
carry = false;
cur.next = addTwoNumbers(l2,new ListNode(1));
}else{
cur.next = l2;
}
}
if(carry){
cur.next = new ListNode(1);
}
return ans.next;
}
}
- 时间复杂度:O(max(m,n)),其中 m,n 为两个链表的长度。我们要遍历两个链表的全部位置,而处理每个位置只需要 O(1) 的时间。
- 空间复杂度:O(max(m,n))。答案链表的长度最多为较长链表的长度 +1。