369. Plus One Linked List

time：2018.01.07

Given a non-negative integer represented as non-empty a singly linked list of digits, plus one to the integer.

You may assume the integer do not contain any leading zero, except the number 0 itself.

The digits are stored such that the most significant digit is at the head of the list.

Example:

Input:
1->2->3

Output:
1->2->4

用dfs做，dfs返回下一个元素是否有进位，同时如果判断到了最后一个节点，应该将最后一个节点的值进行加一操作。

设置dummynode，在返回过程中判断是否需要需要补0

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* plusOne(ListNode* head) {
        ListNode* dummy = new ListNode(0);
        dummy->next = head;
        dummy->val = dummy->val + dfs(dummy->next);
        return dummy->val == 0 ? dummy->next : dummy;
    }
private:
    int dfs(ListNode* node) {
        if (node->next == NULL) {
            node->val++;
            if (node->val == 10) {
                node->val = 0;
                return 1;
            }
            else {
                return 0;
            }
        }
        node->val = node->val + dfs(node->next);
        if (node->val == 10) {
            node->val = 0;
            return 1;
        }
        else {
            return 0;
        }
    }
};