My LeetCode grinding. Trying to do a problem a day.
Nevar pievienot vairāk kā 25 tēmas Tēmai ir jāsākas ar burtu vai ciparu, tā var saturēt domu zīmes ('-') un var būt līdz 35 simboliem gara.

problem.txt 329B

12345
  1. Given a non-empty array of digits representing a non-negative integer, plus one to the integer.
  2. 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.
  3. You may assume the integer does not contain any leading zero, except the number 0 itself.