leetcode— Integer to Roman
来源：互联网 发布：php接口代码 编辑：程序博客网 时间：2024/04/28 06:58
Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999.
class Solution { public String intToRoman(int num) { String[] s1 = {"","I","II","III","IV","V","VI","VII","VIII","IX"}; String[] s2 = {"","X","XX","XXX","XL","L","LX","LXX","LXXX","XC"}; String[] s3 = {"","C","CC","CCC","CD","D","DC","DCC","DCCC","CM"}; String[] s4 = {"","M","MM","MMM"}; String s = s4[num/1000]+s3[num/100%10]+s2[num/10%10]+s1[num%10]; return s; }}**思路：记住几个最主要的数字的对应关系
基本字符：
I、V、X、L、C、D、M
相应的阿拉伯数字表示为：
1．5、10、50、100、500、1000**
阅读全文
0 0
- leetcode— Integer to Roman
- LeetCode Roman to Integer && Integer to Roman
- 【leetcode】Roman to Integer | Integer to Roman
- Leetcode - "Roman to Integer" & "Integer to Roman"
- LeetCode:Roman to Integer,Integer to Roman
- LeetCode Integer to Roman & Roman to Integer
- leetcode - roman to integer & integer to roman
- LeetCode:Roman to Integer
- LeetCode: Integer to Roman
- LeetCode: Roman to Integer
- LeetCode Integer to Roman
- LeetCode: Integer to Roman
- LeetCode : Roman to Integer
- [Leetcode] Roman to Integer
- [Leetcode] Integer to Roman
- Leetcode: Integer to Roman
- Leetcode: Roman to Integer
- LeetCode Integer to Roman
- 洛谷 P2785 物理1（phsic1）- 磁通量
- JAVA-dispose()方法
- C#——索引器使用总结
- 100. Same Tree
- Android开发中的网络判断
- leetcode— Integer to Roman
- 元组与字典练习题
- GDB十分钟教程，插图完整可显示
- 第十四周项目3
- leetcode 628. Maximum Product of Three Numbers
- ideal部署vue
- Apache Jena Fuseki的使用（windows 7）
- JavaScript中清空数组的三种方式
- 入门级python爬虫项目
