66. Plus One 难度:easy
来源:互联网 发布:淘宝主营类目 大类目 编辑:程序博客网 时间:2024/05/20 13:14
题目:
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 {public: vector<int> plusOne(vector<int>& digits) { int c = 1; for(int i = digits.size() - 1; i >= 0; -- i) { int a = digits[i] + c; digits[i] = a % 10; c = a / 10; } if(c == 1) digits.insert(digits.begin(), 1); return digits; }};
0 0
- 66. Plus One 难度:easy
- 66. Plus One (Easy)
- 66. Plus One [easy] (Python)
- Easy-题目30:66. Plus One
- Leetcode 66. Plus One (Easy) (cpp)
- Plus One [Easy]
- 5.[easy]Plus one
- [Leetcode 66, Easy] Plus One
- 【LeetCode】(66)Plus One (Easy)
- Easy 66题 Plus One
- leetcode Plus One 1.5 难度系数1
- Leet Code OJ 66. Plus One [Difficulty: Easy]
- Easy 14 Plus One(66)
- LeetCode-Easy刷题(13) Plus One
- [LeetCode]66.Plus One
- LeetCode --- 66. Plus One
- [Leetcode] 66. Plus One
- [leetcode] 66.Plus One
- kafka权威指南 第一章翻译 Meet Kafka
- oracle学习之:搭建DataGuard
- Effective Java: 并发
- 全部最大上升子序列
- javascript 烟花效果
- 66. Plus One 难度:easy
- 商人小鑫
- 并查集详解
- 自定义处理函数,文本处理,汉字截取
- 守护进程 设计
- 安卓开发中MVP模式的应用(附实例)
- SolrCloud 集群搭建
- verilog中有符号数运算
- LA 2572 Viva Confetti 离散化 *