LeetCode题解-12-Integer to Roman
2017-03-04 21:59
405 查看
解题思路
题意是说把1~3999之间的数字转成罗马数字。首先要理解罗马数字的表示法,它是按大小结合顺序来的,前面几个字母组合起来如果能够解释成较大的数字,那就使用这个表示,而不是按举个字母来的。
所以数字转成罗马数字,就可以从字母可以表示的最大数字开始,每找到一个就是增加对应的罗马数字,并记录对剩余部分数字匹配,直到这个罗马数字过大,再取一个较小的继续尝试。
参考源码
public class Solution { private static String[] romans = {"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"}; private static int[] ints = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1}; public String intToRoman(int num) { int pos = 0; StringBuilder sb = new StringBuilder(); while (num != 0) { if (num >= ints[pos]) { num -= ints[pos]; sb.append(romans[pos]); } else { pos++; } } return sb.toString(); } }
相关文章推荐
- 12. Integer to Roman LeetCode题解
- LeetCodet题解--12. Integer to Roman
- leetcode题解-12. Integer to Roman
- LeetCode题解 #12 Integer to Roman
- leetcode题解||Integer to Roman问题
- leetcode 12 Integer to Roman
- Leetcode_12_Integer to Roman
- leetcode题解 || Roman to Integer问题
- [leetcode 12] Integer to Roman
- 12. Integer to Roman Leetcode Python
- LeetCode题解——Integer to Roman
- LeetCode12: Integer to Roman
- LeetCode | #12 Integer to Roman
- [Leetcode 44] 12 Integer To Roman
- LeetCode --- 12. Integer to Roman
- leetcode_12题——Integer to Roman(string,数学问题)
- 【LeetCode】12. Integer to Roman (2 solutions)
- [Leetcode] 12 - Integer to Roman
- LeetCode 12 — Integer to Roman(C++ Java Python)
- Leetcode 12 Integer to Roman整数变罗马