1+ //
2+ // Created by DHL on 2022年4月29日.
3+ //
4+ 5+ /* *
6+ * Definition for singly-linked list.
7+ * struct ListNode {
8+ * int val;
9+ * ListNode *next;
10+ * ListNode() : val(0), next(nullptr) {}
11+ * ListNode(int x) : val(x), next(nullptr) {}
12+ * ListNode(int x, ListNode *next) : val(x), next(next) {}
13+ * };
14+ */
15+ class Solution2 {
16+ public:
17+ ListNode *addTwoNumbers (ListNode *l1, ListNode *l2) {
18+ stack<int > stack1, stack2;
19+ while (l1) {
20+ stack1.push (l1->val );
21+ l1 = l1->next ;
22+ }
23+ 24+ while (l2) {
25+ stack2.push (l2->val );
26+ l2 = l2->next ;
27+ }
28+ int carry = 0 ;
29+ ListNode *head = nullptr ;
30+ while (!stack1.empty () || !stack2.empty () || carry > 0 ) {
31+ int a = !stack1.empty () ? stack1.top () : 0 ;
32+ int b = !stack2.empty () ? stack2.top () : 0 ;
33+ int sum = a + b + carry;
34+ carry = sum / 10 ;
35+ ListNode *node = new ListNode (sum % 10 );
36+ node->next = head;
37+ head = node;
38+ if (!stack1.empty ()) stack1.pop ();
39+ if (!stack2.empty ()) stack2.pop ();
40+ }
41+ return head;
42+ }
43+ 44+ };
0 commit comments