[leetcode]46 Plus One
2015-04-02 14:33
183 查看
题目链接:https://leetcode.com/problems/plus-one/
Runtimes:4ms
The digits are stored such that the most significant digit is at the head of the list.
Runtimes:4ms
1、问题
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.
2、分析
一开始没看懂题意,后来才明白是一个数,按数位存储在一个vector中,下标[0]存储高位,下标[size() - 1]存储低位,之前做过一道类似的,二进制字符串相加,情况差不多,这道题目更简单些。3、小结
在最前面进位插入1会耗费很多时间,看来还是链表来的好。4、实现
class Solution { public: vector<int> plusOne(vector<int> &digits) { if(digits.size() == 0) return digits; int carry = 1; for(int i = digits.size() - 1; i >= 0; i--) { digits[i] += carry; if(digits[i] >= 10) { digits[i] %= 10; carry = 1; }else{ carry = 0; } } if(carry == 1) { vector <int>::iterator iter = digits.begin(); digits.insert(iter, 1); } return digits; } };
5、反思
题目简单,效果不错。相关文章推荐
- 【leetcode】【66】Plus One
- leetcode-Plus One
- LeetCode(29)-Plus One
- Leetcode 66 Plus One
- leetcode 66. Plus One(高精度加法)
- [leetcode] Plus One
- LeetCode - 66. Plus One - C++ - 4ms Solution
- [LeetCode]66. Plus One
- LeetCode:Plus One
- [leetcode.com]算法题目 - Plus One
- Leetcode-46: Permutations
- leetcode刷题记录-66. Plus One
- Leetcode: Plus One
- Leetcode - Array - 66. Plus One(简单模拟)
- LeetCode - Plus One - Frequent
- leetcode Plus One
- LeetCode-66-Plus One(水题/数值计算)-Easy
- leetcode-66 Plus One
- [LeetCode 66] Plus One
- 66. Plus One | leetcode 66 Java 最短代码实现