首页 > 其他 > 详细

Add Two Numbers

时间:2015-07-06 23:08:01      阅读:277      评论:0      收藏:0      [点我收藏+]
You are given two linked lists representing two non-negative numbers. 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.
 
Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8

  1. /**
  2. * Definition for singly-linked list.
  3. * struct ListNode {
  4. * int val;
  5. * ListNode *next;
  6. * ListNode(int x) : val(x), next(NULL) {}
  7. * };
  8. */
  9. class Solution {
  10. public:
  11. ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
  12. ListNode stackAnchor(0);
  13. ListNode* tail = &stackAnchor;
  14. div_t sum = { 0, 0 };
  15. while(sum.quot > 0 || l1 || l2)
  16. {
  17. if (l1)
  18. {
  19. sum.quot += l1->val;
  20. l1 = l1->next;
  21. }
  22. if (l2)
  23. {
  24. sum.quot += l2->val;
  25. l2 = l2->next;
  26. }
  27. sum = div(sum.quot, 10);
  28. tail->next = new ListNode(sum.rem);
  29. tail = tail->next;
  30. }
  31. return stackAnchor.next;
  32. }
  33. };





Add Two Numbers

原文:http://www.cnblogs.com/ssy-zju/p/4625546.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!