algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-06 17:29:31 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor: DecimalToAnyUsingStack (#5392)

Browse Source
This commit is contained in:
Alex Klymenko
2024-08-25 22:01:52 +02:00
committed by GitHub
parent 25b8010ea8
commit 3187b1f99c
2 changed files with 63 additions and 35 deletions
Download Patch File Download Diff File Expand all files Collapse all files

53
src/main/java/com/thealgorithms/stacks/DecimalToAnyUsingStack.java
View File

@ -6,50 +6,33 @@ public final class DecimalToAnyUsingStack {
private DecimalToAnyUsingStack() {
}
public static void main(String[] args) {
assert convert(0, 2).equals("0");
assert convert(30, 2).equals("11110");
assert convert(30, 8).equals("36");
assert convert(30, 10).equals("30");
assert convert(30, 16).equals("1E");
}
/**
* Convert decimal number to another radix
* Convert a decimal number to another radix.
*
* @param number the number to be converted
* @param radix the radix
* @return another radix
* @throws ArithmeticException if <tt>number</tt> or <tt>radius</tt> is
* invalid
* @return the number represented in the new radix as a String
* @throws IllegalArgumentException if <tt>number</tt> is negative or <tt>radix</tt> is not between 2 and 16 inclusive
*/
private static String convert(int number, int radix) {
if (radix < 2 || radix > 16) {
throw new ArithmeticException(String.format("Invalid input -> number:%d,radius:%d", number, radix));
public static String convert(int number, int radix) {
if (number < 0) {
throw new IllegalArgumentException("Number must be non-negative.");
}
char[] tables = {
'0',
'1',
'2',
'3',
'4',
'5',
'6',
'7',
'8',
'9',
'A',
'B',
'C',
'D',
'E',
'F',
};
if (radix < 2 || radix > 16) {
throw new IllegalArgumentException(String.format("Invalid radix: %d. Radix must be between 2 and 16.", radix));
}
if (number == 0) {
return "0";
}
char[] tables = {'0', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B', 'C', 'D', 'E', 'F'};
Stack<Character> bits = new Stack<>();
do {
while (number > 0) {
bits.push(tables[number % radix]);
number = number / radix;
} while (number != 0);
}
StringBuilder result = new StringBuilder();
while (!bits.isEmpty()) {