leetcode 整数转成罗马数字 C#

最新推荐文章于 2024-06-14 21:59:27 发布

原创最新推荐文章于 2024-06-14 21:59:27 发布 · 414 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode #C#

leetcode 同时被 2 个专栏收录

3 篇文章

订阅专栏

2 篇文章

订阅专栏

本文介绍了一种将整数转换为罗马数字的算法实现，通过解析不同位数的数值并映射到相应的罗马数字字符，实现了从1到3999范围内的整数到罗马数字的转换。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

正好对应吧，感觉这个可能容易一点

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace 整数转罗马数字
{
    class Program
    {
        static void Main(string[] args)
        {
            int num = Convert.ToInt32(Console.ReadLine());
            string str = intToRoman(num);
            Console.WriteLine(str);
            Console.ReadKey();
        }
        public static string intToRoman(int num)
        {
            string Outnum = "";
            int n;
            int index = 0;
            while (num > 0)
            {
                n = num % 10;
                num = (num - n)/10;
                index++;
                Outnum = ChangeString(n, index) + Outnum;
            }
            return Outnum;
        }

        private static string ChangeString(int n, int index)
        {
            string str = "";
            string str1;
            string str2;
            string str3;
            if (index == 1)
            {
                str1 = "I";
                str2 = "V";
                str3 = "X";
            }
            else if (index == 2)
            {
                str1 = "X";
                str2 = "L";
                str3 = "C";
            }
            else if (index == 3)
            {
                str1 = "C";
                str2 = "D";
                str3 = "M";
            }
            else
            {
                str1 = "M";
                str2 = "";
                str3 = "";

            }
            switch (n)
            {
                case 0:

                    break;
                case 1:
                    str += str1;
                    break;
                case 2:
                    str += str1 + str1;
                    break;
                case 3:
                    str += str1 + str1 + str1;
                    break;
                case 4:
                    str += str1 + str2;
                    break;
                case 5:
                    str += str2;
                    break;
                case 6:
                    str += str2 + str1;
                    break;
                case 7:
                    str += str2 + str1 + str1;
                    break;
                case 8:
                    str += str2 + str1 + str1 + str1;
                    break;
                case 9:
                    str += str1 + str3;
                    break;
            }
            return str;
        }
    }
}