问题
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.
思考
这是leetcode上的第二题,难度是medium.
两个数按位相加.其实问题很简单,只有一个问题需要注意, 如果某位的两个数相加大于9,产生进位怎么办?
1 5
+
2 6
在按位加时,另外再定义一个变量 t 代表进位,值只能是0 或者1
t = 0
5 + 6 + t = 11 = 1, t = 1
1 + 2 + t = 4
4 1
方法1
既然是单向链表,那么首先想到用递归.需要特别注意的仍然是进位的处理.
时间复杂度O(n).
空间复杂度O(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) {
return sum(l1, l2, 0);
}
private ListNode sum(ListNode l1, ListNode l2, int t){
if(l1 == null && t == 0)
return l2;
if(l2 == null && t == 0)
return l1;
int sum = t;
ListNode next1 = null, next2 = null;
if(l1 != null){
sum += l1.val;
next1 = l1.next;
}
if(l2 != null){
sum += l2.val;
next2 = l2.next;
}
ListNode node = new ListNode(sum % 10);
node.next = sum(next1, next2, sum / 10);
return node;
}
}
方法2
对于递归,当然也就可以用队列来实现.
时间复杂度O(n).
空间复杂度O(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) {
ListNode head = new ListNode(), node = head;
int t = 0;
while(l1 != null || l2 != null || t != 0){
int sum = t;
if(l1 != null){
sum += l1.val;
l1 = l1.next;
}
if(l2 != null){
sum += l2.val;
l2 = l2.next;
}
node.next = new ListNode(sum % 10);
node = node.next;
t = sum / 10;
}
return head.next;
}
}