zoukankan      html  css  js  c++  java
  • LeetCode题解 #12 Integer to Roman

    题目大意:给定数字,将其转化为罗马数字的形式

    罗马数字其实只有 I V X L C D M 这几种形式,其余均为组合的,去百度了解一下就ok。

    所以首先想到的就是,将个、十、百、千位的数字构造出来,然后直接用就好了。

    要特别注意为整10,整100、1000的情况。

    String [] ge ={"I","II","III","IV","V","VI","VII","VIII","IX"};

    String [] shi = {"X","XX","XXX","XL","L","LX","LXX","LXXX","XC"};

    String [] bai = {"C","CC","CCC","CD","D","DC","DCC","DCCC","CM"};

    String [] qian = {"M","MM","MMM"};


    public String intToRoman(int num) {


    String result = "";
    String g = "";
    String s = "";
    String b = "";
    String q = "";



    if(num%10>0){
    g = ge[num%10-1];
    num/=10;}else{

    g="";
    num/=10;
    }



    if(num>0){

    if(num%10>0){
    s = shi[num%10-1];
    num/=10;}else{

    s="";
    num/=10;
    }

    if(num>0){

    if(num%10>0){
    b = bai[num%10-1];
    num/=10;}else{

    b="";
    num/=10;
    }

    if(num>0){

    q=qian[num%10-1];
    num/=10;

    return q+b+s+g;


    }
    else{

    return b+s+g;

    }


    }
    else{

    return s+g;

    }



    }
    else
    return g;


    }

    更精简的代码(将整10、100、1000的情况整合到数组里面)

    string intToRoman(int num) {

    string roman[4][10] = {

    {"", "I", "II", "III", "IV", "V", "VI", "VII", "VIII", "IX"},

    {"", "X", "XX", "XXX", "XL", "L", "LX", "LXX", "LXXX", "XC"},

    {"", "C", "CC", "CCC", "CD", "D", "DC", "DCC", "DCCC", "CM"},

    {"", "M", "MM", "MMM"}

    };

    string ret = "";

    int digit = 0;

    while (num)

    {ret = roman[digit++][num % 10] + ret, num /= 10; return ret; }

  • 相关阅读:
    AttributeError: module 'scipy.misc' has no attribute 'imread'
    3.形态学
    2.几何变换_图像金字塔
    ValueError:Object arrarys cannot be loaded when allow_pickle=False
    2.几何变换_切分合并通道
    2.几何变换_遮挡
    49. Group Anagrams
    151. Reverse Words in a String
    242. Valid Anagram
    227. Basic Calculator II
  • 原文地址:https://www.cnblogs.com/wzben/p/5017982.html
Copyright © 2011-2022 走看看