My LeetCode grinding. Trying to do a problem a day.
Nelze vybrat více než 25 témat Téma musí začínat písmenem nebo číslem, může obsahovat pomlčky („-“) a může být dlouhé až 35 znaků.

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.