题目:难度(Easy)
Given a non-negative integer represented as a non-empty array 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.
分析:最重要是审题。将整数用array表示,给array的最后一位加一。要考虑如果尾数为9,则会存在进位的问题。
eg:[8,8]为[8,9] ; [7,9]为[8,0] ;[9,9,9]为[1,0,0,0](array需要增加一位)
思路:模仿别人写出,第二遍时改出更为简洁的方案--为自己赞一个。设置一个flag,需要进位是flag=1,不需要进位时flag=0,
最后一位如果进位,则在array[0]插入1.
for i in range((n-1),-1,-1),反向浏览list