Repository navigation
Expand file tree
/
Copy pathNextLargerNumber.java
More file actions
81 lines (59 loc) · 2.04 KB
/
Copy pathNextLargerNumber.java
File metadata and controls
81 lines (59 loc) · 2.04 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
package com.abn.dsalgos.datastructure.problems;
/*
https://leetcode.com/problems/next-greater-element-iii/editorial/
Given a number, find the next highest number possible with same set of digits.
Eg: 12
o/p: 21
Eg: 25876
o/p: 26578
Eg: 21
o/p: -1
*/
public class NextLargerNumber {
public int nextLarger(int number) {
char[] digits = ("" + number).toCharArray();
int index = digits.length - 2;
while (index >= 0 && (int) digits[index] >= (int) digits[index + 1]) {
index --;
}
if (index < 0) {
return -1;
}
int dipIndex = index;
index = digits.length - 1;
while ((int) digits[index] <= (int) digits[dipIndex]) {
index --;
}
int swapIndex = index;
char[] swappedArray = swap(digits, swapIndex, dipIndex);
StringBuilder reversedStringBuilder = reverse(swappedArray, dipIndex);
for (index = dipIndex; index >= 0; index --) {
reversedStringBuilder.insert(0, swappedArray[index]);
}
// Try-catch to handle case of : 2147483648 in LC
try {
return Integer.parseInt(reversedStringBuilder.toString());
} catch (Exception ex) {
return -1;
}
}
private char[] swap(char[] digits, int swapIndex, int dipIndex) {
char tempChar = digits[swapIndex];
digits[swapIndex] = digits[dipIndex];
digits[dipIndex] = tempChar;
return digits;
}
private StringBuilder reverse(char[] swapped, int dipIndex) {
StringBuilder sb = new StringBuilder();
for (int index = swapped.length - 1; index > dipIndex; index--) {
sb.append(swapped[index]);
}
return sb;
}
public static void main(String[] args) {
NextLargerNumber nextLargerNumber = new NextLargerNumber();
System.out.println(nextLargerNumber.nextLarger(21));
System.out.println(nextLargerNumber.nextLarger(218765));
System.out.println(nextLargerNumber.nextLarger(269542));
}
}