problem369

README

< Previous 　　　　　　　　　　　　　　　　 Next >

369. Plus One Linked List (Medium)

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]

Related Topics

[Recursion] [Linked List]

Similar Questions

1. Plus One (Easy)