445. Add Two Numbers II
You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first 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.
Follow up:
What if you cannot modify the input lists? In other words, reversing the lists is not allowed.Example:
Input: (7 -> 2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 8 -> 0 -> 7
// 整体思路:用栈即可
/**
* 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) {
stack<ListNode*> s1;
stack<ListNode*> s2;
stack<ListNode*> result;
while(l1){
s1.push(l1);
l1 = l1->next;
}
while(l2){
s2.push(l2);
l2 = l2->next;
}
int jw = 0;
while(!s1.empty() || !s2.empty()){
if(!s1.empty()){
l1 = s1.top();
s1.pop();
}else
l1 = NULL;
if(!s2.empty()){
l2 = s2.top();
s2.pop();
}else
l2 = NULL;
int sum = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + jw;
jw = sum / 10;
result.push(new ListNode(sum % 10));
}
// 注意最后的进位
if(jw)
result.push(new ListNode(1));
// 将结果依次出栈
ListNode* newHead = result.top();
result.pop();
ListNode* pCur = newHead;
while(!result.empty()){
pCur->next = result.top();
result.pop();
pCur = pCur->next;
}
return newHead;
}
};