【注意】LeetCode 2. Add Two Numbers

LeetCode 2. Add Two Numbers

这种沙比提怎么都写不对了???
Solution1:学习这种写法

/**
 * 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) {
        ListNode *res = new ListNode(-1);
        ListNode *cur = res;
        int carry = 0;
        while (l1 || l2) {
            int n1 = l1 ? l1->val : 0;
            int n2 = l2 ? l2->val : 0;
            int sum = n1 + n2 + carry;
            carry = sum / 10;
            cur->next = new ListNode(sum % 10);
            cur = cur->next;
            if (l1) l1 = l1->next;
            if (l2) l2 = l2->next;
        }
        if (carry) cur->next = new ListNode(1);
        return res->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
出错啦
系统繁忙,请稍后再试

关闭