[LeetCode] 66. Plus One

轉自LeetCode

Given a non-negative number represented as an array of digits, plus one to the number.

The digits are stored such that the most significant digit is at the head of the list.

<Solution>

這題不困難，就是把數值加１

處理好進位問題就可以了

code 如下
c++

kotlin