leetcode 445. Add Two Numbers II

You are given two non-empty linked lists representing two non-negative integers. The most significant digit comes first 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.

Follow up:
What if you cannot modify the input lists? In other words, reversing the lists is not allowed.

Example:

Input: (7 -> 2 -> 4 -> 3) + (5 -> 6 -> 4)
Output: 7 -> 8 -> 0 -> 7

我的做法，不是很好，用了vector这个容器，等下看看别人的做法，

/**
 * 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) {
        vector<int> vl1,vl2;
        for (ListNode * head = l1; head != NULL; head = head -> next){
            vl1.push_back(head->val);
        }
        for (ListNode * head = l2; head != NULL; head = head -> next){
            vl2.push_back(head->val);
        }
        
        int size_min = vl1.size() < vl2.size() ? vl1.size() : vl2.size();
        vector<int>::iterator iter1 = --vl1.end(),iter2 = --vl2.end();
        vector<int> result;
        int num = 0, move = 0;
        for (int i = 0; i < size_min; i ++ ){
            num = *iter1-- + *iter2-- + move;
            if (num > 9) 
                {
                    move = 1;
                    num = num %10;
                }
            else move = 0;
            result.push_back(num);
        }
        vector<int> vll =  vl1.size() < vl2.size() ? vl2 : vl1;
        vector<int>::iterator iterl = --vll.end();
        for (int i = 0; i < vll.size(); i ++){
            if (i < size_min){
                iterl -- ;
            }
            else{
                num = *iterl-- + move;
                 if (num > 9) 
                {
                    move = 1;
                    num = num %10;
                }
                else move = 0;
                result.push_back(num);
            }
        }
        if (move!=0) {
            result.push_back(move);
        }
        vector<int>::iterator iterr = --result.end();
        ListNode * add = new ListNode(0);
        add -> val = *iterr--;
        ListNode * result_head = add;
        for (int i = 0; i<result.size() - 1;i++){
            result_head -> next = new ListNode(0);
            result_head = result_head -> next;
            result_head -> val = * iterr--;
        }
        return add;
    }
};

class Solution {
public:
    ListNode* addTwoNumbers(ListNode* l1, ListNode* l2) {
        vector<int> vl1,vl2;
        while(l1){
            vl1.push_back(l1 -> val);
            l1 = l1 -> next;
        }
        while(l2){
            vl2.push_back(l2 -> val);
            l2 = l2 -> next;
        }   
        int carry = 0;
        ListNode * head = NULL, *now = NULL; 
        int m =vl1.size(), n = vl2.size();
        int num = 0;
        for (int i = m -1, j = n-1; i >= 0 || j >=0 || carry > 0; i--,j--){
            num = 0;
            if (i >= 0){
                num += vl1[i];
            }
            if (j >= 0){
                num += vl2[j];
            }
            num += carry;
            carry = num /10;
            now = new ListNode(num%10);
            now -> next = head;
            head = now;
        }
        return head;
    }
};

被人的做法，思路其实和我差不多，都把vector当动态