Plus One Linked List

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

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode plusOne(ListNode head) {
        List<Integer> temp = new ArrayList<Integer>();
        
        ListNode move = head;
        while(move != null) {
            temp.add(move.val);
            move = move.next;
        }
        
        int carry = 1;
        ListNode last = new ListNode(-1);
        for(int i = temp.size() - 1; i >= 0; i--) {
            int total = carry + temp.get(i);
            last.val = total % 10;
            carry = total / 10;
            
            ListNode pre = new ListNode(-1);
            pre.next = last;
            last = pre;
        }
        
        if (carry == 1) {
            last.val = 1;
            return last;
        } else {
            return last.next;
        }
    }
}