LeetCode 2. Add Two Numbers

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/zjxxyz123/article/details/79971398

问题描述

  • 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.

问题分析

  • 将链表相应位置相加,并注意进位问题即可

代码实现

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode addTwoNumbers(ListNode l1, ListNode l2) {
        if (l1 == null || l2 == null) {
            return null;
        }
        ListNode cur1 = l1;
        ListNode cur2 = l2;
        ListNode dummy = new ListNode(0);
        ListNode newTail = dummy;
        int carry = 0;
        //将两链对应元素带进位相加
        while (cur1 != null || cur2 != null) {
            int val = 0;
            if (cur1 != null) {
                val += cur1.val;
                cur1 = cur1.next;
            }
            if (cur2 != null) {
                val += cur2.val;
                cur2 = cur2.next;
            }
            newTail.next = new ListNode((val + carry) % 10);
            newTail = newTail.next;
            //进位信息
            carry = (val + carry) / 10;
        }
        //最终的进位信息
        if (carry != 0) {
            newTail.next = new ListNode(carry);
        }
        return dummy.next;
    }
        /*
        while (cur1 != null && cur2 != null) {
            int val = (cur1.val + cur2.val + carry) % 10;
            newTail.next = new ListNode(val);
            newTail = newTail.next;
            carry = (cur1.val + cur2.val + carry) / 10;
            cur1 = cur1.next;
            cur2 = cur2.next;
        }
        while (cur1 != null) {
            int val = (cur1.val + carry) % 10;
            newTail.next = new ListNode(val);
            newTail = newTail.next;
            carry = (cur1.val + carry) / 10;
            cur1 = cur1.next;
        }
         while (cur2 != null) {
            int val = (cur2.val + carry) % 10;
            newTail.next = new ListNode(val);
            newTail = newTail.next;
            carry = (cur2.val + carry) / 10;
            cur2 = cur2.next;
        }
        if (carry != 0) {
            newTail.next = new ListNode(carry);
        }
        return dummy.next;
    }
    */
}
阅读更多

Add Two Numbers的问题

08-02

求助,LeetCode OJ 上的第二题Add Two Numbers,不熟练链表的我卡在这儿了,两个被加数位数相同算法没问题,位数不相同执行就当了。。。。一直没看出什么问题,调试器只有gdb,不会用。求大神帮忙看看是什么问题,跪谢。rnrn/*Add two numbersrn You are given two linked lists representing two non-negative numbers. rn The digits are stored in reverse order and each of their nodes contain a single digit. rn Add the two numbers and return it as a linked list.rn rn Input: (2 -> 4 -> 3) + (5 -> 6 -> 4)rn Output: 7 -> 0 -> 8rn*/rnrn//定义简单结点rnstruct ListNode rn int val;rn ListNode *next;rn ListNode(int x) : val(x), next(NULL) rn;rnrn//创建解决方案rnclass Solution rnpublic:rn ListNode* addTwoNumbers( ListNode* l1, ListNode* l2 ) rn ListNode *pHead , *pCurr; //定义头指针 , 当前指针rn int sum , val1 , val2 , carry; //定义和,被加数1,被加数2,进位数rn pHead = ( ListNode * )malloc( sizeof( ListNode ) ); //创建第一个结点rn pCurr = pHead; //初始化当前结点rn carry = 0; //初始化进位数rn while( l1 != NULL || l2 != NULL ) //循环直到两个被加数的当前指针都为空rn rn val1 = l1 != NULL ? l1->val : 0; //为被加数赋值rn val2 = l2 != NULL ? l2->val : 0;rn rn sum = ( val1 + val2 + carry ) % 10; //求和rn carry = ( val1 + val2 + carry ) / 10; //求进位rn rn pCurr->val = sum; //为储存结果的链表添加数字rn if ( l1->next != NULL || l2->next != NULL) //储存结果的链表添加下一个结点rn pCurr->next = ( ListNode * )malloc( sizeof( ListNode ) );rn pCurr = pCurr->next;rn rn rn if ( l1 != NULL ) //被加数指针下移rn l1 = l1->next;rn rn if ( l2 != NULL )rn l2 = l2->next;rn rn rn rn if ( carry != 0) //循环结束进位结算rn pCurr->next = ( ListNode * )malloc( sizeof( ListNode ) );rn pCurr = pCurr->next;rn pCurr->val = carry;rn rn rn pCurr->next = NULL;rn rn return pHead; //输出结果rn rn;

没有更多推荐了,返回首页