[LeetCode] Plus One
来源:互联网 发布:淘宝刀创 编辑:程序博客网 时间:2024/06/05 14:59
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.
直接show code!
class Solution {public:vector<int> plusOne(vector<int> &digits) {int i;for (i = digits.size() - 1; i >= 0; --i){if (digits[i] != 9){++digits[i];return digits;}else {digits[i] = 0;}}//各位全是9if (i < 0) {digits.insert(digits.begin(), 1);}return digits;}};
0 0
- LeetCode: Plus One
- LeetCode Plus One
- [Leetcode] Plus One
- LeetCode: Plus One
- leetcode 33: Plus One
- [LeetCode] Plus One
- [leetCode] Plus One
- 【leetcode】Plus One
- [LeetCode]Plus One
- [leetcode]Plus One
- LeetCode-Plus One
- [leetcode] plus one
- LeetCode - Plus One
- [LeetCode] Plus one
- LeetCode:Plus One
- leetcode之Plus One
- leetcode plus one
- LeetCode | Plus One
- hdu 4634 Swipe Bo
- XBOOT核心组件之KOBJ技术详解
- 线段树扫描线uva11983
- 3.6.9 Using AUTO_INCREMENT
- Poj2318
- [LeetCode] Plus One
- 【数据结构_map容器迭代】Anagrams
- mahou 安装实例
- SRM556题解(T3除外)
- Linux驱动的platform机制
- Poj2653
- Codeforces Round #253 (Div. 1)D题
- 2014 MySql安装图解
- 黑马程序员—java技术blog—第四篇:List和Set的总结