-
-
Notifications
You must be signed in to change notification settings - Fork 31
Expand file tree
/
Copy pathPlus One.java
More file actions
executable file
·131 lines (108 loc) · 3.63 KB
/
Copy pathPlus One.java
File metadata and controls
executable file
·131 lines (108 loc) · 3.63 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
E
1516342836
tags: Array, Math
简单的实现, 加1, 进位. 唯一取巧的地方, 最后如果要多一位, 一定是10000...这个模式, 可以走捷径, 直接来个+1size的array, 然后第一位=1.
注意,转换成long也不合理,用太多memory.
```
/*
Given a non-negative number represented as an array of digits, plus one to the number.
You may assume the integer do not contain any leading zero, except the number 0 itself.
The digits are stored such that the most significant digit is at the head of the list.
Example
Given [1,2,3] which represents 123, return [1,2,4].
Given [9,9,9] which represents 999, return [1,0,0,0].
Tags Expand
Array
*/
/**
Thoughts:
Loop over all digit and see if it advanced into next position. If not, return digits.
Check if last position if over 10, if so, create a new array and set last pos = 1.
*/
public class Solution {
public int[] plusOne(int[] digits) {
if(digits.length==0) return digits;
digits[digits.length-1] += 1;
//Check index digit.length-1 to 1
for(int i = digits.length-1; i>0; i--){
if(digits[i] == 10){
digits[i]=0;
digits[i-1]+=1;
}
else return digits;
}
//Check index 0. If ==0, set it to 0 and carry over 1
if(digits[0]==10){
int[] output = new int[digits.length+1];
output[0] = 1;
return output;
}
else return digits;
}
}
public class Solution {
public int[] plusOne(int[] digits) {
if(digits.length==0) return digits;
digits[digits.length-1] += 1;
//Check index digit.length-1 to 1
for(int i = digits.length-1; i>0; i--){
if(digits[i] == 10){
digits[i]=0;
digits[i-1]+=1;
}
else return digits;
}
//Check index 0. If ==0, set it to 0 and carry over 1
if(digits[0]==10){
int[] output = new int[digits.length+1];
output[0] = 1;
output[1] = 0;
for(int i=2; i<output.length-1; i++){
output[i]=digits[i-1];
}
return output;
}
else return digits;
}
}
/* Trivial solution
create a secondary method func(int index, int[]digits).
add check index from digits.length-1 to 0: digits[index]+1==10? 0 : digits[index]+1;
if add up to 10, push into another level; if not ,return digits.
if index==0, check if add up to 10. If ==10, create a new array and put 1 infront. else return digits.
*/
/*
Thoughts: Old soluton .will fail LeetCode
It looks I should convert array to int, then add, and then convert back to array.
1. Convert to string: Arrays.toString(xxx);
2. Integer.parseInt(str)
3. add
4. split to int array
Note:
Int may not hold the rst since it could exceed 32 bits, so use Long.
But ... What if long does not work neither?
*/
public class Solution {
/**
* @param digits a number represented as an array of digits
* @return the result
*/
public int[] plusOne(int[] digits) {
if (digits == null || digits.length == 0) {
return null;
}
String str = "";
for (int i = 0; i < digits.length; i++) {
str += digits[i];
}
long digit = Long.parseLong(str);
digit += 1;
str = digit + "";
int[] rst = new int[str.length()];
for (int i = 0; i < str.length(); i++) {
rst[i] = Character.getNumericValue(str.charAt(i));
}
return rst;
}
}
```