leetcode Plus ONE
来源:互联网 发布:java模拟 qq加好友 编辑:程序博客网 时间:2024/06/05 04:13
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.
分析:这是一个进位加法运算,设置进位变量add,初始值1,判断最低位加1后是否满10,满10则add=1,否则=0;如此循环。直至结束:
vector<int> plusOne(vector<int>& digits) { int i;int sum=0;int add=1;vector<int>a(digits.size(),0);for(i=digits.size()-1;i>=0;i--){sum=digits[i]+add;add=sum/10;a[i]=sum%10;}if(add==1)a.insert(a.begin(),add);return a; }
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
- 利用php-java-bridge包实现PHP调用JAVA类
- How to prevent object bloat in PostgreSQL
- 基于Theano的深度学习(Deep Learning)框架Keras学习随笔-03-优化器
- ListView 禁止Item被点击
- iOS中UITabBarController的剖析
- leetcode Plus ONE
- lintcode-背包问题II-125
- 黑马程序员——反射与其相关概念
- Vi and Vim Macro Tutorial: How To Record and Play
- iOS推送机制
- android 抓取wifi网卡的数据包
- [c++]使用前后缀表示常量的类型
- 读书一定要掌握正确的阅读方法:读书10
- oracle11g 导入导出