[LeetCode] Plus One
来源:互联网 发布:15年广东省的经济数据 编辑:程序博客网 时间:2024/05/01 16: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.
class Solution {public: vector<int> plusOne(vector<int> &digits) { reverse(digits.begin(), digits.end()); int i = 0, c = 0; digits[0] += 1; while(i < digits.size()) { int tmp = digits[i] + c; digits[i] = tmp % 10; c = tmp / 10; i++; } if(c == 1) digits.push_back(1); reverse(digits.begin(), digits.end()); return digits; }};
怎么看着略蛋疼呢,好像用STL做太简单了。。。额
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
- activity返回数据
- java--泛型
- 2013年算法组题目2
- 二叉查找树的实现
- linux内核系统调用和标准C库函数的关系分析
- [LeetCode] Plus One
- CF 9A. Die Roll
- Java数组与内存控制
- GStreamer播放教程02——字幕管理
- seam中的<s:validateEquality>标签
- java集合类总结
- 利用Java编写简单的WebService实例
- java文件复制
- RTB, DSP, AdExchange知识点汇总