LeetCode_13---Roman to Integer

最新推荐文章于 2021-01-04 00:57:15 发布
最新推荐文章于 2021-01-04 00:57:15 发布
阅读量307 收藏
点赞数
分类专栏： LeetCode 算法分析与设计 文章标签： LeetCode java 算法
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/bingbing8219/article/details/46346039
版权

Given a roman numeral, convert it to an integer.

Input is guaranteed to be within the range from 1 to 3999.

翻译：罗马数字转换为整数

    Code:

    import java.util.HashMap;
import java.util.Map;


/**
 * @author MohnSnow
 * @time 2015年6月3日 下午3:16:46
 * 
 */
public class LeetCode13 {


<span style="white-space:pre">	</span>/**
<span style="white-space:pre">	</span> * @param argsmengdx
<span style="white-space:pre">	</span> *            -fnst
<span style="white-space:pre">	</span> */
<span style="white-space:pre">	</span>/*
<span style="white-space:pre">	</span> * test:
<span style="white-space:pre">	</span> * 个位数举例
<span style="white-space:pre">	</span> * Ⅰ,1 】Ⅱ，2】 Ⅲ，3】 Ⅳ，4 】Ⅴ，5 】Ⅵ，6】Ⅶ，7】 Ⅷ，8 】Ⅸ，9 】
<span style="white-space:pre">	</span> * 十位数举例
<span style="white-space:pre">	</span> * Ⅹ，10】 Ⅺ，11 】Ⅻ，12】 XIII,13】 XIV,14】 XV,15 】XVI,16 】XVII,17 】XVIII,18】
<span style="white-space:pre">	</span> * XIX,19】 XX,20】 XXI,21 】XXII,22 】XXIX,29】 XXX,30】 XXXIV,34】 XXXV,35 】
<span style="white-space:pre">	</span> * XXXIX,39】 XL,40】 L,50 】LI,51】 LV,55】 LX,60】 LXV,65】 LXXX,80】 XC,90 】
<span style="white-space:pre">	</span> * XCIII,93】 XCV,95 】XCVIII,98】 XCIX,99 】
<span style="white-space:pre">	</span> * 百位数举例
<span style="white-space:pre">	</span> * C,100】 CC,200 】CCC,300 】CD,400】 D,500 】DC,600 】DCC,700】 DCCC,800 】CM,900】
<span style="white-space:pre">	</span> * CMXCIX,999】
<span style="white-space:pre">	</span> * 千位数举例
<span style="white-space:pre">	</span> * M,1000】 MC,1100 】MCD,1400 】MD,1500 】MDC,1600 】MDCLXVI,1666】 MDCCCLXXXVIII,1888 】
<span style="white-space:pre">	</span> * MDCCCXCIX,1899 】MCM,1900 】MCMLXXVI,1976】 MCMLXXXIV,1984】
<span style="white-space:pre">	</span> * MCMXC,1990 】MM,2000 】MMMCMXCIX,3999】
<span style="white-space:pre">	</span> * 千位数以上举例
<span style="white-space:pre">	</span> * ，65,259 】，134945584】， 183650】
<span style="white-space:pre">	</span> */
<span style="white-space:pre">	</span>//444msA
<span style="white-space:pre">	</span>public static int romanToInt(String s) {
<span style="white-space:pre">		</span>s = s + " ";//防止(i+1)溢出
<span style="white-space:pre">		</span>int len = s.length();
<span style="white-space:pre">		</span>int re = 0;
<span style="white-space:pre">		</span>for (int i = 0; i < len; i++) {
<span style="white-space:pre">			</span>switch (s.charAt(i)) {
<span style="white-space:pre">				</span>case 'M':
<span style="white-space:pre">					</span>re = re + 1000;
<span style="white-space:pre">					</span>break;
<span style="white-space:pre">				</span>case 'D':
<span style="white-space:pre">					</span>re = re + 500;
<span style="white-space:pre">					</span>break;
<span style="white-space:pre">				</span>case 'C':
<span style="white-space:pre">					</span>if (s.charAt(i + 1) == 'M') {
<span style="white-space:pre">						</span>re = re + 900;
<span style="white-space:pre">						</span>i++;
<span style="white-space:pre">					</span>} else if (s.charAt(i + 1) == 'D') {
<span style="white-space:pre">						</span>re = re + 400;
<span style="white-space:pre">						</span>i++;
<span style="white-space:pre">					</span>} else {
<span style="white-space:pre">						</span>re = re + 100;
<span style="white-space:pre">					</span>}
<span style="white-space:pre">					</span>break;
<span style="white-space:pre">				</span>case 'L':
<span style="white-space:pre">					</span>re = re + 50;
<span style="white-space:pre">					</span>break;
<span style="white-space:pre">				</span>case 'V':
<span style="white-space:pre">					</span>re = re + 5;
<span style="white-space:pre">					</span>break;
<span style="white-space:pre">				</span>case 'X':
<span style="white-space:pre">					</span>if (s.charAt(i + 1) == 'C') {
<span style="white-space:pre">						</span>re = re + 90;
<span style="white-space:pre">						</span>i++;
<span style="white-space:pre">					</span>} else if (s.charAt(i + 1) == 'L') {
<span style="white-space:pre">						</span>re = re + 40;
<span style="white-space:pre">						</span>i++;
<span style="white-space:pre">					</span>} else {
<span style="white-space:pre">						</span>re = re + 10;
<span style="white-space:pre">					</span>}
<span style="white-space:pre">					</span>break;


<span style="white-space:pre">				</span>case 'I':
<span style="white-space:pre">					</span>if (s.charAt(i + 1) == 'X') {
<span style="white-space:pre">						</span>re = re + 9;
<span style="white-space:pre">						</span>i++;
<span style="white-space:pre">					</span>} else if (s.charAt(i + 1) == 'V') {
<span style="white-space:pre">						</span>re = re + 4;
<span style="white-space:pre">						</span>i++;
<span style="white-space:pre">					</span>} else {
<span style="white-space:pre">						</span>re = re + 1;
<span style="white-space:pre">					</span>}
<span style="white-space:pre">					</span>break;
<span style="white-space:pre">				</span>default:
<span style="white-space:pre">					</span>break;
<span style="white-space:pre">			</span>}
<span style="white-space:pre">		</span>}
<span style="white-space:pre">		</span>return re;
<span style="white-space:pre">	</span>}


<span style="white-space:pre">	</span>//528msA  但是此版本的C++代码只用64ms
<span style="white-space:pre">	</span>public static int romanToInt1(String s) {
<span style="white-space:pre">		</span>int result = 0;
<span style="white-space:pre">		</span>Map<Character, Integer> hashMap = new HashMap<Character, Integer>(7);
<span style="white-space:pre">		</span>hashMap.put('I', 1);
<span style="white-space:pre">		</span>hashMap.put('V', 5);
<span style="white-space:pre">		</span>hashMap.put('X', 10);
<span style="white-space:pre">		</span>hashMap.put('L', 50);
<span style="white-space:pre">		</span>hashMap.put('C', 100);
<span style="white-space:pre">		</span>hashMap.put('D', 500);
<span style="white-space:pre">		</span>hashMap.put('M', 1000);
<span style="white-space:pre">		</span>for (int i = s.length() - 1; i >= 0; i--)
<span style="white-space:pre">		</span>{
<span style="white-space:pre">			</span>if (i == s.length() - 1)
<span style="white-space:pre">			</span>{//最后一个加一会溢出  
<span style="white-space:pre">				</span>result = hashMap.get(s.charAt(i));
<span style="white-space:pre">				</span>continue;
<span style="white-space:pre">			</span>}
<span style="white-space:pre">			</span>if (hashMap.get(s.charAt(i)) >= hashMap.get(s.charAt(i + 1)))
<span style="white-space:pre">				</span>result += hashMap.get(s.charAt(i));
<span style="white-space:pre">			</span>else
<span style="white-space:pre">				</span>result -= hashMap.get(s.charAt(i));
<span style="white-space:pre">		</span>}
<span style="white-space:pre">		</span>return result;
<span style="white-space:pre">	</span>}


<span style="white-space:pre">	</span>public static void main(String[] args) {
<span style="white-space:pre">		</span>String a = "MDCLXXXIX";//1689
<span style="white-space:pre">		</span>//a = "DCXXI";//1689
<span style="white-space:pre">		</span>System.out.println(a);
<span style="white-space:pre">		</span>System.out.println(romanToInt(a));
<span style="white-space:pre">		</span>System.out.println(romanToInt1(a));
<span style="white-space:pre">	</span>}


}








    小学生Jason
    关注
    专栏目录
    java-leetcode题解之012-Integer-to-Roman
    08-31
    java入门 java_leetcode题解之012_Integer_to_Roman
    c语言-leetcode 0013-roman-to-integer.zip
    08-22
    c c语言_leetcode 0013_roman_to_integer.zip
    Leetcode_roman-to-integer
    x
    05-21 693
    地址：https://oj.leetcode.com/problems/roman-to-integer/ Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.
    leetcode-#13. Roman to Integer
    天使之翼
    10-17 230
    Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X 10 L 50 C 100 D ...
    LeetCode--integer-to-roman
    wl_ss的博客
    01-18 272
    题目描述 Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999. 分析：熟悉罗马数字和阿拉伯数字的转换规则，题目算法本身没有太大亮点 class Solution { public:
    12-integer-to-roman
    wj903829182的专栏
    10-28 233
    题目描述： Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X 10 L 50 C 100 D ...
    LeetCode13-Roman to Integer(C++)
    PengQ1的博客
    04-04 226
    Description Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I              &...
    Leetcode 12 integer-to-roman
    eclipsycn的博客
    12-14 324
    https://leetcode.com/problems/integer-to-roman/discuss/ Given an integer, convert it to a roman numeral. Input is guaranteed to be within the range from 1 to 3999.解释： 罗马数字共有7个，即I（1）、V（5）、X（10）、L（50）
    leetcode-#12 Integer to Roman
    天使之翼
    10-10 244
    Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X 10 L 50 C 100 D 5...
    leetcode-13. Roman to Integer
    NNnora的博客
    08-01 350
    leetcode12题的变式，罗马数字转换为阿拉伯数字 题目类型： HashMap，字符串 题意： Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999. 我的思路： 66% 步骤： 将字符串的各位转化为...
    LeetCode - Easy - 13. Roman to Integer
    KISS
    01-04 136
    Topic Math String Description https://leetcode.com/problems/roman-to-integer/ Roman numerals are represented by seven different symbols: I, V, X, L, C, D and M. Symbol Value I 1 V 5 X 10 L 50 C
    java-leetcode题解之013-Roman-to-Integer
    最新发布
    08-31
    java入门 java_leetcode题解之013_Roman_to_Integer
    Leetcode回文串拼接-leetcode_note:用于记录leetcode题目的解析
    07-06
    Leetcode回文串拼接 leetcode_node 题解 该项目主要用于基于Leetcode的刷题记录，与日常...13.Roman To Integer 289 347 380 442 457 Circular Array Loop 535 Encode and Decode TinyURL 560 565 566 Maximum Binary T
    Leetcode-Algorithm-Exercise
    04-06
    1_TwoSum 9_PalindromeNumber 13_RomanToInteger 14_LongestCommonPrefix 20_ValidParentheses 21_MergeTwoSortedLists 26_RemoveDuplicatesFromSortedArray 27_RemoveElement 28_ImplementStrStr（） 35_Search...
    LeetCode_71---Simplify Path
    MohnSnow,Winter is Coming!!!
    07-01 566
    Given an absolute path for a file (Unix-style), simplify it. For example, path = "/home/", => "/home" path = "/a/./b/../../c/", => "/c" click to show corner cases. Corner Cases: Did you co
    LeetCode_50---Pow(x, n)
    MohnSnow,Winter is Coming!!!
    06-25 543
    Implement pow(x, n). Hide Tags  Math Binary Search 翻译： Code： /** * */ package From41; /** * @author MohnSnow * @time 2015年6月25日 上午10:41:33 *
    LeetCode_69---Sqrt(x)
    MohnSnow,Winter is Coming!!!
    07-01 487
    Implement int sqrt(int x). Compute and return the square root of x. Hide Tags  Math Binary Search 翻译：求平方值 Code： /** * */ package From61; /** * @author MohnSnow
    LeetCode_27---Remove Element
    MohnSnow,Winter is Coming!!!
    06-11 483
    Given an array and a value, remove all instances of that value in place and return the new length. The order of elements can be changed. It doesn't matter what you leave beyond the new length. 翻
    AcWing暑期LeetCode刷题班-树专题：判断BST
    "AcWing夏季LeetCode刷题活动介绍及树相关题目解析" 在AcWing的暑期LeetCode刷题活动中，参与者将面临一系列精选的高频率算法题目，总计80道，涵盖了各种数据结构和算法主题。活动分为8周进行，每周会有10道题目，...
    评论
    添加红包

    请填写红包祝福语或标题

    个

    红包个数最小为10个

    元

    红包金额最低5元

    当前余额3.43元 前往充值 >
    需支付：10.00元
    成就一亿技术人!
    领取后你会自动成为博主和红包主的粉丝 规则
    hope_wisdom
    发出的红包
    实付元
    使用余额支付
    点击重新获取
    扫码支付
    钱包余额 0

    抵扣说明：

    1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
    2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

    余额充值