leetcode - Plus One
来源:互联网 发布:java agent 哨兵 编辑:程序博客网 时间:2024/06/05 11:34
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.
class Solution {public: std::vector<int> plusOne(std::vector<int> &digits) { std::vector<int> result;int t = 1;for(int i = digits.size() - 1; i >= 0; i--){t += digits[i];result.insert(result.begin(),t % 10);t /= 10;}if(t > 0){result.insert(result.begin(),t);}return result; }};
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
- MongoDB(一)NoSQL起源
- csdn 博客 新手报到
- C#设计模式(5)——建造者模式(Builder Pattern)
- 模版:struts.xml
- HTML简介
- leetcode - Plus One
- hdu 1205 有意思的小题 2种解法 鸽巢原理
- oracle数据库的备份与恢复(expdp与impdp)
- 【记录吧】2014.10.14
- 【iOS开发-48】九宫格布局案例:自动布局、字典转模型运用、id和instancetype区别、xib重复视图运用及与nib关系
- 想用winsock编写一个简单的聊天程序,显示的全是乱码
- 数据结构之二叉树(遍历、建立、深度)
- 大数据
- python快速排序