两数相加II 结合反转

class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        ListNode *head = nullptr, *tail = nullptr;
        int carry = 0;
        l1=reverseList(l1);
        l2=reverseList(l2);
        while (l1 || l2) {
            int n1 = l1 ? l1->val: 0;
            int n2 = l2 ? l2->val: 0;
            int sum = n1 + n2 + carry;
            if (!head) {
                head = tail = new ListNode(sum % 10);
            } else {
                tail->next = new ListNode(sum % 10);
                tail = tail->next;
            }
            carry = sum / 10;
            if (l1) {
                l1 = l1->next;
            }
            if (l2) {
                l2 = l2->next;
            }
        }
        if (carry > 0) {
            tail->next = new ListNode(carry);
        }
        head=reverseList(head);
        return head;
    }
    ListNode *reverseList(ListNode *head){
        ListNode *p1=head;
        if (p1==nullptr)
        {
            return nullptr;
        }
        ListNode *p=new ListNode(-1);
        //临时指针模拟头结点
        p->next=head;
        head=p;
        
        ListNode *current=head->next;
        ListNode *pre=nullptr;
        ListNode *nextnode;
        while (current!=nullptr)
        {
            nextnode=current->next;
            current->next=pre;
            pre=current;
            current=nextnode;
        }
        head->next=pre;
        return head->next;
    }
};