https://leetcode.com/problems/add-two-numbers/
struct ListNode { int val; ListNode *next; ListNode(int x) : val(x), next(NULL) {} }; class Solution { public: ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) { ListNode* res = new ListNode(-1); ListNode* cur = res; //指针 int carry=0; //进位 while (l1||l2) { int n1=l1?l1->val:0; int n2=l2?l2->val:0; int sum=n1+n2+carry; carry=sum/10; //进位 cur->next=new ListNode(sum%10); cur=cur->next; if(l1) l1=l1->next; if(l2) l2=l2->next; } if(carry) cur->next=new ListNode(1); return res->next; //第一个节点是-1.后面才是真正的 } };
