zoukankan      html  css  js  c++  java
  • integer-to-roman

    /**
    *
    * @author gentleKay
    * Given an integer, convert it to a roman numeral.
    * Input is guaranteed to be within the range from 1 to 3999.
    *
    * 给定一个整数,将其转换为罗马数字。
    * 输入保证在1到3999之间。
    *
    * 了解一下罗马数字的写法:
    * 1-9:1-Ⅰ、2-Ⅱ、3-Ⅲ、4-Ⅳ、5-Ⅴ、6-Ⅵ、7-Ⅶ、8-Ⅷ、9-Ⅸ。
    * 10-20:10-Ⅹ、11-Ⅺ、12-Ⅻ、13-XIII、14-XIV、15-XV、16-XVI、17-XVII、18-XVIII、19-XIX、20-XX。
    */

    这两题可以对比的进行学习:

    roman-to-integer: https://www.cnblogs.com/strive-19970713/p/11250501.html

    /**
     * 
     * @author gentleKay
     * Given an integer, convert it to a roman numeral.
     * Input is guaranteed to be within the range from 1 to 3999.
     * 
     * 给定一个整数,将其转换为罗马数字。
     * 输入保证在1到3999之间。
     * 
     * 了解一下罗马数字的写法:
     * 1-9:1-Ⅰ、2-Ⅱ、3-Ⅲ、4-Ⅳ、5-Ⅴ、6-Ⅵ、7-Ⅶ、8-Ⅷ、9-Ⅸ。
     * 10-20:10-Ⅹ、11-Ⅺ、12-Ⅻ、13-XIII、14-XIV、15-XV、16-XVI、17-XVII、18-XVIII、19-XIX、20-XX。
     */
    
    public class Main09 {
    
    	public static void main(String[] args) {
    		int num = 2345;
    		System.out.println(Main09.intToRoman(num));
    	}
    	
    	public static String intToRoman(int num) {
    		String one[]={"I","II","III","IV","V","VI","VII","VIII","IX"}; // 1-9
    	    String ten[]={"X","XX","XXX","XL","L","LX","LXX","LXXX","XC"}; // 10 - 90
    	    String hundred[]={"C","CC","CCC","CD","D","DC","DCC","DCCC","CM"}; // 100 - 900
    	    String thous[]={"M","MM","MMM"}; // 1000 - 3000
    	    
    	    String str  = "";
    	    if (num >= 1000) {
    	    	str = str + thous[num/1000-1];
    	    	num = num%1000;
    	    }
    	    if (num >= 100) {
    	    	str = str + hundred[num/100-1];
    	    	num = num % 100;
    	    }
    	    if (num >= 10) {
    	    	str = str + ten[num/10-1];
    	    	num = num % 10;
    	    }
    	    if (num >= 1) {
    	    	str = str + one[num-1];
    	    }
    	    return str;
    	    
    	    
        }
    }
    

      

  • 相关阅读:
    函数
    关联子查询
    子查询
    视图(VIEW)
    顺时针打印矩阵
    二叉树的镜像
    树的子结构
    将两个有序链表合并
    反转链表
    输出链表中倒数第k个结点
  • 原文地址:https://www.cnblogs.com/strive-19970713/p/11238129.html
Copyright © 2011-2022 走看看