-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram17.java
More file actions
97 lines (65 loc) · 2.16 KB
/
program17.java
File metadata and controls
97 lines (65 loc) · 2.16 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
/*
66. Plus One
Easy
7.1K
4.9K
Companies
You are given a large integer represented as an integer array digits, where each digits[i] is the ith digit of the integer. The digits are ordered from most significant to least significant in left-to-right order. The large integer does not contain any leading 0's.
Increment the large integer by one and return the resulting array of digits.
Example 1:
Input: digits = [1,2,3]
Output: [1,2,4]
Explanation: The array represents the integer 123.
Incrementing by one gives 123 + 1 = 124.
Thus, the result should be [1,2,4].
Example 2:
Input: digits = [4,3,2,1]
Output: [4,3,2,2]
Explanation: The array represents the integer 4321.
Incrementing by one gives 4321 + 1 = 4322.
Thus, the result should be [4,3,2,2].
Example 3:
Input: digits = [9]
Output: [1,0]
Explanation: The array represents the integer 9.
Incrementing by one gives 9 + 1 = 10.
Thus, the result should be [1,0].
*/
package LeetCode;
public class program17 {
static int[] plusOne(int[] digits) {
long sum=0;
for(int i=0;i<digits.length;i++){
sum = sum *10+digits[i];
System.out.print(sum+" ");
}
System.out.println(sum);
sum = sum +1;
long temp =sum;
long i =sum;
System.out.println(i);
int cnt=0;
while(temp!=0){
cnt++;
temp /=10;
}
int res[] = new int[cnt];
int x = cnt-1;
while(i!=0){
int rem = (int)(i %10);
res[x] = rem;
i/=10;
x--;
// System.out.print(rem+" ");
}
return res;
}
public static void main(String[] args) {
int[] digits ={7,2,8,5,0,9,1,2,9,5,3,6,6,7,3,2,8,4,3,7,9,5,7,7,4,7,4,9,4,7,0,1,1,1,7,4,0,0,6};
int a[] = new int[digits.length+1];
a = plusOne(digits);
for(int i=0;i<a.length;i++){
System.out.print(a[i]+" ");
}
}
}