Solving Plus One in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

The digits are stored such that the most significant digit is at the head of the list, and each element in the array contain a single digit.

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

Example 1:

Input: [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.

Example 2:

Input: [4,3,2,1]
Output: [4,3,2,2]
Explanation: The array represents the integer 4321.

See the full details of the problem Plus One at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go