Leetcode 2. Add Two Numbers

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

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

AC代码,有些人喜欢写的简单点: p1 != NULL 就直接写成 p1, 不过我就是喜欢写的更直接啦。评论区里有11行的骚操作,不过本质上都是一样的。

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        int flag = 0;
        int addNumber;
        struct ListNode* p1, *p2, *p3, *l3;
        p1 = l1; p2 = l2;
        struct ListNode dummyNode(-1); //不设虚节点的话很难循环和返回,否则要判断NULL太麻烦
        l3 = &dummyNode;
        p3 = l3;
       
        while(p1 != NULL && p2 != NULL){
            addNumber = p1->val + p2->val + flag;
            if(addNumber >=10){
                flag = 1;
                addNumber = addNumber - 10;
            }else{
                flag = 0;
            } 
            p3->next = new ListNode(addNumber);
            p3 = p3->next; p1 = p1->next; p2 = p2->next;
        }
        
        if(p1 == NULL && p2 != NULL){ //L2比L1短
           while(p2 != NULL){
               addNumber = p2->val + flag;
               if(addNumber >= 10){
                   flag = 1;
                   addNumber = addNumber - 10;
               }else{
                   flag = 0;
               }
               p3->next = new ListNode(addNumber);  
               p3 = p3->next; p2 = p2->next;
           } 
        }
        
        if(p1 != NULL && p2 == NULL){//L1比L2短
            while(p1 != NULL){
               addNumber = p1->val + flag;
               if(addNumber >= 10){
                   flag = 1;
                   addNumber = addNumber - 10;
               }else{
                   flag = 0;
               }
               p3->next = new ListNode(addNumber);
               p3 = p3->next;  p1 = p1->next;
           } 
        }
        
        if (flag == 1){//最后有进位
           p3->next = new ListNode(1);
        }
        
        return l3->next;
    }
};

评论区的11行-  -:

ListNode *addTwoNumbers(ListNode *l1, ListNode *l2) {
    ListNode preHead(0), *p = &preHead;
    int extra = 0;
    while (l1 || l2 || extra) {
        int sum = (l1 ? l1->val : 0) + (l2 ? l2->val : 0) + extra;
        extra = sum / 10;
        p->next = new ListNode(sum % 10);
        p = p->next;
        l1 = l1 ? l1->next : l1;
        l2 = l2 ? l2->next : l2;
    }
    return preHead.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;

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

私密
私密原因:
请选择设置私密原因
  • 广告
  • 抄袭
  • 版权
  • 政治
  • 色情
  • 无意义
  • 其他
其他原因:
120
出错啦
系统繁忙,请稍后再试

关闭