LeetCode||66. Plus One
来源:互联网 发布:淘宝老a cpu 编辑:程序博客网 时间:2024/06/03 05:06
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.
类似于大数相加,不过这是加一,简化版本class Solution(object): def plusOne(self, digits): """ :type digits: List[int] :rtype: List[int] """ if not digits: return [1] if digits[-1]==9: res = self.plusOne(digits[:-1]) res.append(0) return res else: digits[-1] += 1 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
- Linux-----源码安装keepalived
- 在权限不够的linux服务器上自定义jieba分词的tmp_dir和cache_file属性
- MongoDB 集合
- MongoDB 数据类型
- stm32 中printf使用
- LeetCode||66. Plus One
- Kubernetes对象之StatefulSets(有状态系统服务设计)
- 以Pager的形式填充到ViewPager
- Maven·1st(入门)
- MongoDB 数据库
- SASS语法
- 面试题
- hive数据库与表的创建
- MongoDB删除数据库和删除集合