2、Add Two Numbers
问题描述:
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.
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
分析
给定两个链表,进行加法操作,若有进位,将进位值加到next上。
利用两个指针分别遍历两个链表,用一个变量表示是否有进位。某个链表遍历结束之后再将另一个链表连接在结果链表之后即可,若最后有进位需要添加一位。
C++实现
/**
* Definition for singly-linked list.
* struct ListNode {
* int val;
* ListNode *next;
* ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
int carry = 0;
ListNode* tail = new ListNode(0);
ListNode* ptr = tail;
while (l1 != NULL || l2 != NULL){
int val1 = 0;
if (l1 != NULL){
val1 = l1->val;
l1 = l1->next;
}
int val2 = 0;
if (l2 != NULL){
val2 = l2->val;
l2 = l2->next;
}
int temp = val1 + val2 + carry;
ptr->next = new ListNode(temp % 10);
carry = temp / 10;
ptr = ptr->next;
}
if (carry == 1){
ptr->next = new ListNode(1);
}
return tail->next;
}
};
Python实现:
# Definition for singly-linked list.
# class ListNode(object):
# def __init__(self, x):
# self.val = x
# self.next = None
class Solution(object):
def addTwoNumbers(self, l1, l2):
"""
:type l1: ListNode
:type l2: ListNode
:rtype: ListNode
"""
p = dummy = ListNode(-1)
carry = 0
while l1 or l2 or carry:
val = (l1 and l1.val or 0) + (l2 and l2.val or 0) + carry
carry = val / 10
p.next = ListNode(val % 10)
l1 = l1 and l1.next
l2 = l2 and l2.next
p = p.next
return dummy.next