leetcode 66. Plus One
来源:互联网 发布:网页设计js特效 编辑:程序博客网 时间:2024/06/06 07:34
题目:
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.
给一个整数序列,加1并返回
class Solution(object):
def plusOne(self, digits):
"""
:type digits: List[int]
:rtype: List[int]
"""
l = len(digits);n=1
for i in range(l):
s = digits[l-i-1]+n
digits[l-i-1] = s%10;n=s/10
if n>0:digits.insert(0,n)
return digits
0 0
- [LeetCode]66.Plus One
- LeetCode --- 66. Plus One
- [Leetcode] 66. Plus One
- [leetcode] 66.Plus One
- [leetcode] 66. Plus One
- Leetcode-66. Plus One
- 【leetcode】66. Plus One
- 66. Plus One LeetCode
- 【LeetCode】66. Plus One
- [LeetCode]66. Plus One
- 【LeetCode】66. Plus One
- LeetCode 66. Plus One
- LeetCode *** 66. Plus One
- leetcode 66. Plus One
- 【leetcode】66. Plus One
- leetcode 66. Plus One
- [LeetCode]66. Plus One
- Leetcode 66. Plus One
- BZOJ 3211: 花神游历各国 线段树区间开根
- 大数据学习研究系列之Hbase1.24稳定版完全分布式部署之前的准备【一】
- activiti工作流的web流程设计器整合视频教程 SSM和独立部署
- RGBD-SLAM(一)——深度摄像机
- 字典序单词
- leetcode 66. Plus One
- Node.js笔记
- SimpleCommand(一) 框架介绍以及简单使用
- elasticsearch5.2搜索结果排序
- MySQL学习(二)DQL 加强,表与表的关系,及查询,主外键约束
- Shader学习之
- 由ip计算子网掩码和默认网关
- 转:Socket和ServerSocket中SO_REUSEADDR的用处
- 操作系统的概述