{
  "type": "code_options",
  "author": "csdn.net",
  "source": "solution.md",
  "exercise_id": "fc109d2e803d4682bc8c90bff1aa9428",
  "keywords": "递归,链表,数学",
  "title": "两数相加",
  "desc": [
    {
      "content": "\n<p>给你两个 <strong>非空</strong> 的链表，表示两个非负的整数。它们每位数字都是按照 <strong>逆序</strong> 的方式存储的，并且每个节点只能存储 <strong>一位</strong> 数字。</p><p>请你将两个数相加，并以相同形式返回一个表示和的链表。</p><p>你可以假设除了数字 0 之外，这两个数都不会以 0 开头。</p><p> </p><p><strong>示例 1：</strong></p><img alt=\"\" src=\"https://cdn.jsdelivr.net/gh/doocs/leetcode@main/solution/0000-0099/0002.Add%20Two%20Numbers/images/addtwonumber1.jpg\" style=\"width: 483px; height: 342px;\" /><pre><strong>输入：</strong>l1 = [2,4,3], l2 = [5,6,4]<strong><br />输出：</strong>[7,0,8]<strong><br />解释：</strong>342 + 465 = 807.</pre><p><strong>示例 2：</strong></p><pre><strong>输入：</strong>l1 = [0], l2 = [0]<strong><br />输出：</strong>[0]</pre><p><strong>示例 3：</strong></p><pre><strong>输入：</strong>l1 = [9,9,9,9,9,9,9], l2 = [9,9,9,9]<strong><br />输出：</strong>[8,9,9,9,0,0,0,1]</pre><p> </p><p><strong>提示：</strong></p><ul>\t<li>每个链表中的节点数在范围 <code>[1, 100]</code> 内</li>\t<li><code>0 <= Node.val <= 9</code></li>\t<li>题目数据保证列表表示的数字不含前导零</li></ul>",
      "language": "markdown"
    }
  ],
  "answer": [
    {
      "content": "",
      "language": "cpp"
    }
  ],
  "prepared": [
    [
      {
        "content": "",
        "language": "cpp"
      }
    ],
    [
      {
        "content": "",
        "language": "cpp"
      }
    ],
    [
      {
        "content": "",
        "language": "cpp"
      }
    ]
  ],
  "template": {
    "content": "struct ListNode\n{\n\tint val;\n\tstruct ListNode *next;\n};\nstruct ListNode *addTwoNumbers(struct ListNode *l1, struct ListNode *l2)\n{\n\tstruct ListNode *pp = NULL, *p = l1;\n\tstruct ListNode *qp = NULL, *q = l2;\n\tint carry = 0;\n\twhile (p != NULL && q != NULL)\n\t{\n\t\tp->val += q->val + carry;\n\t\tcarry = 0;\n\t\tif (p->val >= 10)\n\t\t{\n\t\t\tcarry = 1;\n\t\t\tp->val -= 10;\n\t\t}\n\t\tpp = p;\n\t\tp = p->next;\n\t\tqp = q;\n\t\tq = q->next;\n\t}\n\tif (q)\n\t{\n\t\tpp->next = p = q;\n\t\tqp->next = NULL;\n\t}\n\twhile (carry && p)\n\t{\n\t\tp->val += carry;\n\t\tcarry = 0;\n\t\tif (p->val >= 10)\n\t\t{\n\t\t\tcarry = 1;\n\t\t\tp->val -= 10;\n\t\t}\n\t\tpp = p;\n\t\tp = p->next;\n\t}\n\tif (carry)\n\t{\n\t\tstruct ListNode *n = (struct ListNode *)malloc(sizeof(struct ListNode));\n\t\tn->val = 1;\n\t\tn->next = NULL;\n\t\tpp->next = n;\n\t}\n\treturn l1;\n}",
    "language": "cpp"
  },
  "node_id": "dailycode-ac2a4675e933469195468c03c2062381",
  "license": "csdn.net",
  "created_at": 1637894158,
  "topic_link": "https://bbs.csdn.net/topics/600469916"
}