Write a RomanNumeral class that encapsulates a Roman numeral value. The methods

Question

Write a RomanNumeral class that encapsulates a Roman numeral value. The methods the class has are: public void read(), public void set(String), public void set(RomanNumeral), public RomanNumeral add(RomanNumeral), public RomanNumeral subtract(RomanNumeral), public RomanNumeral multiply(RomanNumeral), public RomanNumeral divide(RomanNumeral), public RomanNumeral add(int), public RomanNumeral subtract(int), public RomanNumeral multiply(int), public RomanNumeral divide(int), public boolean equals(RomanNumeral), and public String toString(). Although historically there are many ways to write Roman numerals we will use these rules: The symbols "I", "X", "C", and "M" can be repeated three times in succession, but no more. "D", "L", and "V" can never be repeated. "I" can be subtracted from "V" and "X" only. "X" can be subtracted from "L" and "C" only. "C" can be subtracted from "D" and "M" only. "V", "L", and "D" can never be subtracted Only one small-value symbol may be subtracted from any large-value symbol.
I will provide a main program as the demo.

public class RomanNumeralDemo
{
public static final int ARRAY_SIZE = 5;
public static void main(String[] args)
{
RomanNumeral rn1 = new RomanNumeral ("XXIV");
RomanNumeral rn2 = new RomanNumeral ("III");
RomanNumeral rn4, rn5, rn6, rn7;
RomanNumeral rn8 = new RomanNumeral(1999);
int number;
System.out.println ("Roman Numeral number of integer: " + rn8);
RomanNumeral [] RomanNumeralArray = new RomanNumeral [ARRAY_SIZE];
System.out.println ("First Roman Numeral number: " + rn1);
System.out.println ("Second Roman Numeral number: " + rn2);
if (rn1.equals(rn2))
System.out.println ("rn1 and rn2 are equal.");
else
System.out.println ("rn1 and rn2 are NOT equal.");
rn4 = rn1.add(rn2);
rn5 = rn1.subtract(rn2);
rn6 = rn1.multiply(rn2);
rn7 = rn1.divide(rn2);
System.out.println ("rn1 + rn2: " + rn4);
System.out.println ("rn1 - rn2: " + rn5);
System.out.println ("rn1 * rn2: " + rn6);
System.out.println ("rn1 / rn2: " + rn7);
System.out.println ();
number = 25;
System.out.println ("using the integer " + number +
" as the argument to the math operators ");
rn4 = rn1.add(number);
rn5 = rn1.subtract(number);
rn6 = rn1.multiply(number);
rn7 = rn1.divide(number);
System.out.println ("rn1 + number: " + rn4);
System.out.println ("rn1 - number: " + rn5);
System.out.println ("rn1 * number: " + rn6);
System.out.println ("rn1 / number: " + rn7);
//The next two methods must be written by you.
System.out.println ("Fill a roman numeral array with " + ARRAY_SIZE +" roman numerals ");
rn7.readRomanNumeralArray(RomanNumeralArray);
rn7 = rn7.getAverage(RomanNumeralArray);
System.out.println("the average of the Roman numeral “ +
“array is " + rn7);
}
}

Explanation / Answer

public RomanNumeral(int arabic) { if (arabic < 1) throw new NumberFormatException("Value of RomanNumeral must be positive."); if (arabic > 3999) throw new NumberFormatException("Value of RomanNumeral must be 3999 or less."); num = arabic; } /* * Constructor. Creates the Roman number with the given representation. * For example, RomanNumeral("xvii") is 17. If the parameter is not a * legal Roman numeral, a NumberFormatException is thrown. Both upper and * lower case letters are allowed. */ public RomanNumeral(String roman) { if (roman.length() == 0) throw new NumberFormatException("An empty string does not define a Roman numeral."); roman = roman.toUpperCase(); // Convert to upper case letters. int i = 0; // A position in the string, roman; int arabic = 0; // Arabic numeral equivalent of the part of the string that has // been converted so far. while (i number) { // Combine the two letters to get one value, and move on to next position in string. arabic += (nextNumber - number); i++; } else { // Don't combine the letters. Just add the value of the one letter onto the number. arabic += number; } } } // end while if (arabic > 3999) throw new NumberFormatException("Roman numeral must have value 3999 or less."); num = arabic; } // end constructor /** * Find the integer value of letter considered as a Roman numeral. Throws * NumberFormatException if letter is not a legal Roman numeral. The letter * must be upper case. */ private int letterToNumber(char letter) { switch (letter) { case 'I': return 1; case 'V': return 5; case 'X': return 10; case 'L': return 50; case 'C': return 100; case 'D': return 500; case 'M': return 1000; default: throw new NumberFormatException( "Illegal character "" + letter + "" in Roman numeral"); } }

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.