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

Enhance docs, remove main. add more tests (#5925)

Browse Source
This commit is contained in:
Hardik Pawar
2024-10-24 11:20:12 +05:30
committed by GitHub
parent 0feb416188
commit 5246f63579
2 changed files with 73 additions and 48 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
src/test/java/com/thealgorithms/conversions/IntegerToRomanTest.java
View File

@@ -10,5 +10,30 @@ public class IntegerToRomanTest {
public void testIntegerToRoman() {
assertEquals("MCMXCIV", IntegerToRoman.integerToRoman(1994));
assertEquals("LVIII", IntegerToRoman.integerToRoman(58));
assertEquals("IV", IntegerToRoman.integerToRoman(4));
assertEquals("IX", IntegerToRoman.integerToRoman(9));
assertEquals("MMM", IntegerToRoman.integerToRoman(3000));
}
@Test
public void testSmallNumbers() {
assertEquals("I", IntegerToRoman.integerToRoman(1));
assertEquals("II", IntegerToRoman.integerToRoman(2));
assertEquals("III", IntegerToRoman.integerToRoman(3));
}
@Test
public void testRoundNumbers() {
assertEquals("X", IntegerToRoman.integerToRoman(10));
assertEquals("L", IntegerToRoman.integerToRoman(50));
assertEquals("C", IntegerToRoman.integerToRoman(100));
assertEquals("D", IntegerToRoman.integerToRoman(500));
assertEquals("M", IntegerToRoman.integerToRoman(1000));
}
@Test
public void testEdgeCases() {
assertEquals("", IntegerToRoman.integerToRoman(0)); // Non-positive number case
assertEquals("", IntegerToRoman.integerToRoman(-5)); // Negative number case
}
}