Roman Numeral 2

import java.util.Map;
import java.util.SortedMap;
import java.util.TreeMap;

/**
 * @author deliveryninja
 *
 * Given a numeral from 1 to 3000 this will return the Roman
 * numberal equivalent.
 *
 * @param numeral
 * @return
 */
public class Roman {

    //Enum is for storing the relationship between the roman representation
    //and an Integer representation.

    public enum RomanNumeral{
        M(1000),
        CM(900),
        D(500),
        CD(400),
        C(100),
        XC(90),
        L(50),
        XL(40),
        X(10),
        IX(9),
        V(5),
        IV(4),
        I(1);

        private int value;

        RomanNumeral(int value){
            this.value = value;
        }

        public int getIntegerValue() {
            return value;
        }
    }

    /**
    *   Method for converting the give numeral to a roman String representation.
    *
    **/
    public String romanize(int numeral) {

        //Initialise a StringBuilder to store the result
        StringBuilder result = new StringBuilder();

        //Loop through the roman numerals in order, starting with the largest.
        for(RomanNumeral romanNumeral : RomanNumeral.values()){

            //Check given numeral is larger than the roman numeral
            while(numeral >= romanNumeral.getIntegerValue()){

                //Update the result
                result.append(romanNumeral);

                //Reduce the given value
                numeral -= romanNumeral.getIntegerValue();
            }
        }
        //Finally return the result
        return result.toString();
    }

}