刷题——两个链表相加

最新推荐文章于 2024-08-20 15:59:15 发布

菜，那就多练

最新推荐文章于 2024-08-20 15:59:15 发布

阅读量285

点赞数 3

文章标签：链表数据结构

本文链接：https://blog.csdn.net/weixin_62130773/article/details/139784927

版权

原题：链表相加(二)_牛客题霸_牛客网

还没有完全掌握，只学会了反转链表

两个链表相加代码如下

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 *	ListNode(int x) : val(x), next(nullptr) {}
 * };
 */
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param head1 ListNode类 
     * @param head2 ListNode类 
     * @return ListNode类
     */
    ListNode* ReverseList(ListNode* pHead){
            if(pHead == NULL)
                return NULL;
            ListNode* cur = pHead;
            ListNode* pre =NULL;
            while(cur != NULL)
            {
                ListNode* temp = cur->next;
                cur->next = pre;
                pre = cur;
                cur = temp;
            }
            return  pre;
       } 
        // write code here
        ListNode* addInList(ListNode* head1, ListNode* head2)
        {
            if(head1 == NULL) return head2;
            if(head2 == NULL) return head1;
            head1 = ReverseList(head1);
            head2 = ReverseList(head2);
            ListNode* res = new ListNode(-1);
            ListNode* head = res;
            int carry = 0;
            while(head1 != NULL || head2 != NULL || carry != 0)
            {
                 int val1 = head1 == NULL ? 0 : head1->val;
                 int val2 = head2 == NULL ? 0 : head2->val;
                 int temp = val1 + val2 + carry;
                  carry = temp / 10;
                  temp %= 10;
                head->next = new ListNode(temp);
                head = head->next;
            if(head1 != NULL)
                head1 = head1->next;
            if(head2 != NULL)
                head2 = head2->next;
            }
              return ReverseList(res->next);
        }

};