首页 > 代码库 > [leetcode]Plus One @ Python
[leetcode]Plus One @ Python
题意：
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.
解题思路：设置一个进位标志CarryFlag就可以了。For example: 999 + 1 = 1000
代码：
class Solution: # @param digits, a list of integer digits # @return a list of integer digits def plusOne(self, digits): carryFlag = 1 for i in reversed(range(len(digits))): if digits[i] + carryFlag == 10: digits[i] = 0 carryFlag = 1 else: digits[i] += carryFlag carryFlag = 0 if carryFlag == 1: digits.insert(0, 1) return digits
[leetcode]Plus One @ Python
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。