码迷,mamicode.com
首页 > 其他好文 > 详细

[leetcode]66. Plus One加一

时间:2019-04-23 09:28:49      阅读:156      评论:0      收藏:0      [点我收藏+]

标签:div   nbsp   ica   integer   leetcode   lead   mos   The   can   

Given a non-empty array of digits representing a non-negative integer, plus one to the integer.

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.

You may assume the integer does not contain any leading zero, except the number 0 itself.

Example 1:

Input: [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.

Example 2:

Input: [4,3,2,1]
Output: [4,3,2,2]
Explanation: The array represents the integer 4321.

 

 

题意:

高精度加一。

[leetcode]66. Plus One加一

标签:div   nbsp   ica   integer   leetcode   lead   mos   The   can   

原文地址:https://www.cnblogs.com/liuliu5151/p/10754265.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!