https://leetcode.com/problems/add-two-numbers/
解题思路:
时间复杂度 O(n),空间复杂度 O(1)。
和 Plus One 很相似,前者对数组相加,本题是对链表相加。题目告诉链表是反转过的,使得解题变得容易一点。本题主要维护一个进位和当前位,将结果存储在以 head 为表头的链表中。如果遇到 l1 或者 l2 具有更高位时,将高位也要加进链表。如果最后最高位也有进位时,将最高位的进位加进链表。
思考:如果链表是正序存储的呢?
这时可以先反转链表,然后计算结果,最后再反转结果。
public class Solution {
public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
int carry = 0, digit = 0;
ListNode head = null, pre = null;
while(l1 != null && l2 != null) {
digit = (l1.val + l2.val + carry) % 10;
carry = (l1.val + l2.val + carry) / 10;
ListNode newNode = new ListNode(digit);
if(head == null)
head = newNode;
else
pre.next = newNode;
pre = newNode;
l1 = l1.next; l2 = l2.next;
}
while(l1 != null) {
digit = (l1.val + carry) % 10;
carry = (l1.val + carry) / 10;
ListNode newNode = new ListNode(digit);
if(head == null)
head = newNode;
else
pre.next = newNode;
pre = newNode;
l1 = l1.next;
}
while(l2 != null) {
digit = (l2.val + carry) % 10;
carry = (l2.val + carry) / 10;
ListNode newNode = new ListNode(digit);
if(head == null)
head = newNode;
else
pre.next = newNode;
pre = newNode;
l2 = l2.next;
}
if(carry > 0) {
ListNode newNode = new ListNode(carry);
pre.next = newNode;
}
return head;
}
}
参考:http://blog.csdn.net/linhuanmars/article/details/19957829