50. Plus One-Leetcode
来源:互联网 发布:锐捷网络2016年销售额 编辑:程序博客网 时间:2024/06/13 12:22
- Plus One My Submissions QuestionEditorial Solution
Total Accepted: 98403 Total Submissions: 292594 Difficulty: Easy
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.
思路:
比较简单,有进位,当前为置为0,判断下一位+1是否为10,如此继续
最后看最高位是否进位,有进位,插入新的1
时间复杂度:O(n)
空间:O(1)
class Solution {public: vector<int> plusOne(vector<int>& digits) {//这里没说是否修改digits,也没定义为const,所以可以不用另外用存储空间 int n=digits.size(); int k=n-1; while(k>=0&&digits[k]+1>=10)digits[k--]=0; if(k>=0) digits[k]+=1; else digits.insert(digits.begin(),1); return digits;};
0 0
- 50. Plus One-Leetcode
- 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
- 数据结构之排序:冒泡排序
- UIImagePickerController 用法
- ImageView显示手机里的图片
- [Nutch]Apache Solr的安装和配置
- 关于答辩的一些建议
- 50. Plus One-Leetcode
- nyoj_6 喷水装置(一)
- url.openStream()和url.openConnection().getInputStream()两者区别
- (VirtualBox+ubuntu)本机和虚拟机之间共享文件夹
- Jenkins+maven+svn+tomcat操作手册(一)
- 从头认识多线程-2.10 同步代码块的特殊现象:一半同步,一半异步
- HDOJ(HDU) 2113 Secret Number(遍历数字位数的每个数字)
- 加减乘除计算器
- java中Static&Final的使用方法,&&&Java中两个主要的抽象Abstract&&Implement