LeetCode Plus One
来源:互联网 发布:广东政务数据创新大赛 编辑:程序博客网 时间:2024/05/04 08:18
Description:
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:
前面已经做过无数类似的了,拿一个变量pre表示前面累计的和,加法的pre只有0或1,乘法则是从0-9都有可能。
import java.util.*;public class Solution {public int[] plusOne(int[] digits) {int pre = 1;for (int i = digits.length - 1; i >= 0; i--) {digits[i] += 1;pre = 0;System.out.println(pre);if (digits[i] == 10) {digits[i] = 0;pre = 1;}if (pre == 0)return digits;}int[] neo = new int[digits.length + 1];neo[0] = 1;for (int i = 0; i < digits.length; i++)neo[i + 1] = digits[i];return neo;}}
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
- HDU - 3986 Harry Potter and the Final Battle(最短路SPFA+枚举删边)
- IOS--OC--总结
- 网站变为黑白
- android selector android:state_enabled 无效
- jsp页面上传图片防止中文乱码问题
- LeetCode Plus One
- 从尾到头打印链表
- ThinkPHP 2.使用rest
- 在游戏中对A-Star算法应用思路
- 暑假班运营建议
- Android Studio 项目混淆打包时,报错Caused by: java.lang.NoSuchMethodError: android.util.Xml.newPullParser
- 找到第1500个的丑数
- C#中的线程(一)入门
- 【HDU】5267 pog loves szh IV【动态点分治】