题解 | #牛群的能量值#

/**
 * struct ListNode {
 *	int val;
 *	struct ListNode *next;
 *	ListNode(int x) : val(x), next(nullptr) {}
 * };
 */
class Solution {
public:
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param l1 ListNode类 
     * @param l2 ListNode类 
     * @return ListNode类
     */
    ListNode* addEnergyValues(ListNode* l1, ListNode* l2) {
        // write code here
        ListNode* cur1 = l1;
        ListNode* cur2 = l2;
        auto resHead = new ListNode(0);
        ListNode* res = resHead;

        int add = 0;
        int val = 0;
        while (cur1 || cur2) {

            int cur1_val = (cur1 != nullptr ? cur1->val : 0);
            int cur2_val = (cur2 != nullptr ? cur2->val : 0);

            val = (cur1_val + cur2_val + add) % 10;
            add = (cur1_val + cur2_val + add)/10;

            cur1 = (cur1==nullptr ? nullptr:cur1->next);
            cur2 = (cur2==nullptr ? nullptr:cur2->next);

            res->val = val;

            if (cur1 || cur2) {
                res->next = new ListNode(0);
                res = res->next;
            }else {
                if (add == 1) {
                    res->next = new ListNode(add);
                    res = res->next;
                }
            }
        }
        return resHead;
    }
};