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.
本文介绍了一种算法问题:给定一个表示非负整数的非空数字数组,在此基础上加一。可以假设该整数不含前导零(除了数字0本身)。数字以最高有效位在列表头部的方式存储。
5万+

被折叠的 条评论
为什么被折叠?



