[leetcode]Plus One @ Python
原题地址:https://oj.leetcode.com/problems/plus-one/
题意:
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.
解题思路:这只一个flag标志位就可以了。
代码:
class Solution: # @param digits, a list of integer digits # @return a list of integer digits def plusOne(self, digits): flag = 1 for i in range(len(digits)-1, -1, -1): if digits[i] + flag == 10: digits[i] = 0 flag = 1 else: digits[i] = digits[i] + flag flag = 0 if flag == 1: digits.insert(0, 1) return digits
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】博客园社区专享云产品让利特惠,阿里云新客6.5折上折
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步