[数据结构与算法]整数转罗马数字(力扣)

题解(对官方题解的学习):

import java.util.Scanner;

public class Main2 {
	// 通过两个数组的下标,将对应大小的数字建立关系
	static int[] values = { 1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1 };
	static String[] symbols = { "M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I" };

	public static String intToRoman(int num) {
		StringBuffer sbf = new StringBuffer();
		for (int i = 0; i < values.length; i++) {
			int value = values[i];
			String symbol = symbols[i];
			while (num >= value) {
				num -= value;
				sbf.append(symbol);//将与此时value对应的下标相同的罗马数字(symbol)存入sbf中
			}
			if (num == 0) {//此时循环结束
				break;
			}
		}
		System.out.println(sbf.toString());
		return sbf.toString();
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int i = sc.nextInt();
		intToRoman(i);
	}
}

创作打卡挑战赛

赢取流量/现金/CSDN周边激励大奖