2. Add Two Numbers

标签: 链表
2人阅读 评论(0) 收藏 举报
分类:

题目描述

You are given two non-empty linked lists representing two non-negative integers. 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.

You may assume the two numbers do not contain any leading zero, except the number 0 itself.

Example

Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 0 -> 8
Explanation: 342 + 465 = 807.

解题代码

 class Solution {
 public:
     ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
         if (l1 == nullptr)
             return l2;
         if (l2 == nullptr)
             return l1;
         ListNode * LN1 = l1, *LN2 = l2, *sum = nullptr, *current = nullptr;
         int carry = 0;
         sum = current = new ListNode((LN1->val + LN2->val) % 10);
         if ((LN1->val + LN2->val) / 10 > 0)
             carry = 1;
         LN1 = LN1->next;
         LN2 = LN2->next;
         while (LN1 != nullptr && LN2 != nullptr)
         {
             int temp = LN1->val + LN2->val + carry;
             current->next = new ListNode(temp % 10);
             current = current->next;
             LN1 = LN1->next;
             LN2 = LN2->next;
             carry = temp / 10;
         }
         ListNode * temp = LN1 != nullptr ? LN1 : LN2;
         while (temp != nullptr)
         {
             int value = temp->val + carry;
             current->next = new ListNode(value % 10);
             current = current->next;
             carry = value / 10;
             temp = temp->next;
         }
         if (carry != 0) {
             current->next = new ListNode(1);
         }
         return sum;
     }
 };

解题思路

  1. 看懂题目,两个数相加并非简单的对应位相加,还要考虑进位问题。
  2. 要考虑传入参数问题,判断是否为nullptr。
  3. 题目没有说可以修改原有链接,所以最好不要修改。
  4. 新链表需要两个指针,一个指向头部,一个跟着链表移动,所以在循环外就需要new一个节点,让两个指针都指向这个节点。接着再用循环让current指针移动。
  5. 要注意指针的移动是LN1 = LN1->next;,不是LN1++
  6. 循环内new对象是current->next = new ListNode(value % 10);current = current->next;,不是’current = current->next;current= new ListNode(value % 10);’(current是当前有内容非nullptr的节点)
  7. 最后,记得如果最高位还要进位的话记得再多增添最后一个节点。
查看评论

[C语言][LeetCode][2]Add Two Numbers

[C语言][LeetCode][2]Add Two Numbers
  • Timsley
  • Timsley
  • 2016-04-14 21:25:50
  • 942

【LeetCode】2. Add Two Numbers 解题报告

转载请注明出处:http://blog.csdn.net/crazy1235/article/details/51820937Subject 出处:https://leetcode.com/pro...
  • crazy1235
  • crazy1235
  • 2016-10-24 19:46:34
  • 3723

[LeetCode]Add Two Numbers解析

将两个链表的值进行相加,并返回一个新的链表,注意两个地方:一是考虑两个链表的长度是否相同,二是考虑相加后的进位问题 /** * Definition for singly-linked list...
  • rudyn
  • rudyn
  • 2016-08-19 14:12:05
  • 433

【Leetcode】【python】Add Two Numbers

题目大意给定两个链表分别代表两个非负整数。数位以倒序存储,并且每一个节点包含一位数字。将两个数字相加并以链表形式返回。解题思路链表简单相加,到10进位代码根据书影博客class Solution(ob...
  • qqxx6661
  • qqxx6661
  • 2017-07-15 04:05:37
  • 392

《Leetcode系列》C++实现:2-add two numbers

题目:You are given two linked lists representing two non-negative numbers. The digits are stored in re...
  • tengyuan93
  • tengyuan93
  • 2016-09-28 16:36:00
  • 258

leetcode_c++:链表:add two numbers(002)

* #include #include #include #include #include #include using namespace std;struct ListNode{ ...
  • mijian1207mijian
  • mijian1207mijian
  • 2016-05-03 09:49:29
  • 588

LeetCode 2 — Add Two Numbers(C++ Java Python)

题目:http://oj.leetcode.com/problems/add-two-numbers/ You are given two linked lists representing two ...
  • dragon_dream
  • dragon_dream
  • 2014-02-20 14:34:05
  • 6922

leetcode(二)—— Add Two Numbers(Python/C++)

Add Two Numbers | LeetCode OJ 逻辑是简单的,主要是处理进位,以及两序列长度不一致的情况; Python# 链表结点定义 class ListNode(object):...
  • lanchunhui
  • lanchunhui
  • 2016-04-11 09:48:50
  • 639

LeetCode Add Two Numbers 之JavaScript 多种解法

LeetCode Add Two Numbers 之JavaScript 多种解法
  • weixin_36751895
  • weixin_36751895
  • 2017-07-13 12:45:21
  • 503

leetcode 2. Add Two Numbers C语言实现

leetcode 2. Add Two Numbers Description You are given two non-empty linked lists represent...
  • banana1006034246
  • banana1006034246
  • 2017-03-31 19:48:34
  • 1226
    个人资料
    专栏达人 持之以恒
    等级:
    访问量: 1万+
    积分: 1347
    排名: 3万+
    博客专栏
    最新评论