Integer to Roman 解法
来源:互联网 发布:淄博最专业的seo公司 编辑:程序博客网 时间:2024/03/29 21:03
Integer to Roman 解法
第五周题目
难度:Media
LeetCode题号:12
题目
Description:
Given an integer, convert it to a roman numeral.
Input is guaranteed to be within the range from 1 to 3999.
思考
罗马数字的基本型为:I=1,V=5,X=10,L=50,C=100,D=500,M=1000,相同的罗马数字最多不能超过三个。所以对于4只能表示为5-1即IV,左减右加。
同理,9=IX,40=XL,90=XC,400=CD,900=CM。根据这些基本型,可以通过贪心算法,每次匹配最大值得到罗马数字.
代码
class Solution {public: string intToRoman(int num) { int base[] = {1000, 900, 500, 400, 100, 90, 50, 40, 10, 9, 5, 4, 1}; string str[] = {"M", "CM", "D", "CD", "C", "XC", "L", "XL", "X", "IX", "V", "IV", "I"}; string roman = ""; int i = 0; while (num > 0) { if (num >= base[i]) { num -= base[i]; roman += str[i]; } else { i++; } } return roman; }};
阅读全文
0 0
- Integer to Roman 解法
- Integer to Roman问题及解法
- Roman to Integer问题及解法
- 13. Roman to Integer的C++解法
- leetcode[Integer to Roman]//待整理多种解法
- Integer to Roman & Roman to Integer
- Integer to Roman & Roman to Integer
- 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
- Integer to Roman and Roman to Integer
- LeetCode Integer to Roman & Roman to Integer
- Roman to Integer/Integer to Roman
- leetcode - roman to integer & integer to roman
- "Roman to Integer" and "Integer to Roman"
- Roman to Integer &&Integer to Roman
- Roman to Integer and Integer to Roman
- 二叉树的深度
- HDOJ HDU 1068 Girls and Boys
- C# 文件过滤器filter
- hash属性
- 674. Longest Continuous Increasing Subsequence
- Integer to Roman 解法
- Android Sipdroid 对外通话建立过程分析,以及监听通话接通时刻
- 【Hibernate】检索数据的五种方式
- Linux:Linux操作系统Centos7.2版本搭建Apache+PHP+Mysql环境
- Leetcode | Longest Substring Without Repeating Characters
- es6-js
- 关于sublime中文问题
- DPDK学习笔记1--基础概念篇(UIO,大页内存,CPU亲和性,NUMA机制等)
- linux 命令中grep 命令得个人总结(一)