首页 > 其他 > 详细

66. Plus One

时间:2018-08-31 16:41:02      阅读:238      评论:0      收藏:0      [点我收藏+]

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.

 

技术分享图片

 

class Solution(object):
    def plusOne(self, digits):
        """
        :type digits: List[int]
        :rtype: List[int]
        """
        str_num = ‘‘
        for i in digits:
            str_num += str(i)
        new_num = int(str_num)+1
        
        digits_plus_one = []
        for j in str(new_num):
            digits_plus_one.append(int(j))
        return digits_plus_one        

 

以上

66. Plus One

原文:https://www.cnblogs.com/jyg694234697/p/9566364.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!