LeetCode 66. Plus One
来源:互联网 发布:voip软件电话 编辑:程序博客网 时间:2024/05/18 02:21
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.
The logic is very clear. Plus one.
vector<int> plusOne(vector<int>& digits) { int size = digits.size(); digits[size - 1] += 1; // lowest bit is at the end. for(int j = size - 1; j >= 1 && digits[j] == 10; j--) { digits[j] = digits[j] % 10; digits[j-1] += 1; } if(digits[0] == 10) { digits[0] = 0; digits.insert(digits.begin(), 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
- 画图
- Debugging native framework code of Android Java applications
- java 泛型
- Mac环境下为Python安装MySQLdb库时遇到的诸多问题
- VS2012中创建Web服务并编译为dll的方法
- LeetCode 66. Plus One
- iOS开发FMDB
- Hadoop安装与配置
- 欢迎使用CSDN-markdown编辑器
- iOS网络状态监测之Reachability的使用
- Java源码解读——ArrayList
- Hibernate 缓存机制
- 使用ssh开发rest web服务支持http etag header的教程详解
- Linux写代码的夜间模式(保护眼睛),在Linux中安装f.lux