leetcode做题总结,题目Plus One 2012/04/02
2014-07-24 21:29
369 查看
题目是用数组表示的一个数进行加1。我的做法是用一个变量做进位标志量,然后一位一位计算即可。
public int[] plusOne(int[] digits) { int num = digits.length-1; int add=1; while(num>=0){ if(add==1){ if(digits[num]==9){ digits[num]=0; }else{ digits[num]++; add=0; } } num--; } if(add==1){ int[] fin = new int[digits.length+1]; fin[0]=1; for(int i=1;i<digits.length+1;i++){ fin[i]=digits[i-1]; } return fin; } return digits; }
相关文章推荐
- leetcode做题总结,题目Swap Nodes in Pairs 2012/02/14
- leetcode做题总结,题目Merge k Sorted Lists 2012/02/13
- leetcode做题总结,题目Copy List with Random Pointer 2013/10/03
- leetcode做题总结,题目Reverse Nodes in k-Group 2012/02/15
- leetcode做题总结,题目Search Insert Position 2012/03/03
- leetcode做题总结,题目Set Matrix Zeroes 2012/04/06
- leetcode做题总结,题目Insertion Sort List 2013/11/12
- leetcode做题总结,题目Search a 2D MatrixI/II 2012/04/06
- leetcode做题总结,题目Add Two Numbers /Add Binary 2011/11/01&2012/04/02
- leetcode做题总结,题目Longest Consecutive Sequence 2013/02/13
- leetcode做题总结,题目Binary Tree Inorder Traversal 2012/08/27
- leetcode做题总结,题目Best Time to Buy and Sell Stock 2012/10/30
- leetcode做题总结,题目Rotate List 2012/03/27
- leetcode做题总结,题目Search for a Range 2012/03/02
- leetcode做题总结,题目Merge Sorted Array 2012/05/20
- leetcode做题总结,题目Convert Sorted List to Binary Search Tree 2012/10/02
- leetcode做题总结,题目Validate Binary Search Tree 2012/08/31
- leetcode做题总结,题目Gray Code 2012/05/20
- leetcode做题总结,题目Search in Rotated Sorted Array I/II 2012/03/02-12/04/09
- leetcode做题总结,题目Longest Consecutive Sequence 2013/02/13