Plus One
来源:互联网 发布:java程序员学php 编辑:程序博客网 时间:2024/05/16 12:38
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.
Solution:
class Solution {public: vector<int> plusOne(vector<int> &digits) { int flag = 1; for(int i = digits.size()-1; i >= 0 ; --i) { if(!flag) break; digits[i] += 1; if(digits[i] == 10) digits[i] = 0; else flag = 0; } if(flag) { digits.resize(digits.size()+1); for(int i = digits.size()-2; i >= 0; --i) digits[i+1] = digits[i]; digits[0] = 1; } return digits; }};
0 0
- Plus One
- Plus One
- Plus One
- Plus One
- Plus One
- Plus One
- Plus One
- Plus One
- Plus One
- Plus One
- Plus One
- Plus One
- Plus One
- Plus One
- Plus One
- Plus One
- Plus One
- Plus One
- Matlab自己实现Sobel边缘提取和ROA边缘提取
- Redis的Python
- Axis2实现web service接口开发+客户端调用
- 欢迎使用CSDN-markdown编辑器
- 获奖转盘
- Plus One
- sgu207:Robbers(贪心)
- wxWidgets初学者导引
- c#创建带参数的线程
- leetCode #9 Palindrome Number
- 关于Colloder事件
- ubuntu eclipse c++ launch failed binary not found
- Express相关问题集合
- Android发短信代码