[leetcode] Roman to Integer

最新推荐文章于 2019-03-02 17:08:52 发布

风一样的逗B

最新推荐文章于 2019-03-02 17:08:52 发布

阅读量327

点赞数

分类专栏： leetcode Algorithms Java

本文链接：https://blog.csdn.net/intmain_Rocking/article/details/43273903

版权

leetcode Algorithms Java 专栏收录该内容

26 篇文章 0 订阅

订阅专栏

Given a roman numeral, convert it to an integer.

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

package com.wyt.leetcodeOJ;

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

/**
 * @author wangyitao
 * @Date 2015-01-29
 * @version 1.0
 * @Description
 * Given a roman numeral, convert it to an integer.
 * Input is guaranteed to be within the range from 1 to 3999.
 *
 */
public class RomanToInteger {

	public static void main(String[] args) {
		System.out.println(romanToInt("XCIX"));
	}
	
	public static int romanToInt(String s) {
        int result = 0;
        
        Map<Character, Integer> map = new HashMap<Character, Integer>();
        map.put('I', 1);
        map.put('V', 5);
        map.put('X', 10);
        map.put('L', 50);
        map.put('C', 100);
        map.put('D', 500);
        map.put('M', 1000);
        
        if (s.length() == 1) {
			return map.get(s.charAt(0));
		}
        
        for (int i = 0; i < s.length() - 1; i++) {
			if (map.get(s.charAt(i)) >= map.get(s.charAt(i+1))) {
				result += map.get(s.charAt(i));
			} else {
				result -= map.get(s.charAt(i));
			}
		}
        
        result += map.get(s.charAt(s.length()-1));
        return result;
    }

}