# Convert Roman to Integer number - Leet Code Solution

September 13, 2019

## Problem Statement

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             500
M             1000``````

For example, two is written as II in Roman numeral, just two one’s added together. Twelve is written as, XII, which is simply X + II. The number twenty seven is written as XXVII, which is XX + V + II.

Roman numerals are usually written largest to smallest from left to right. However, the numeral for four is not IIII. Instead, the number four is written as IV. Because the one is before the five we subtract it making four. The same principle applies to the number nine, which is written as IX. There are six instances where subtraction is used:

``````I can be placed before V (5) and X (10) to make 4 and 9.
X can be placed before L (50) and C (100) to make 40 and 90.
C can be placed before D (500) and M (1000) to make 400 and 900.``````

Given a roman numeral, convert it to an integer. Input is guaranteed to be within the range from 1 to 3999.

## Solution

Its a rather easy solution. You need to maintain a mapping. The extra condition here is, the input character can be of one or two char long.

So, you need to fetch if there is a mapping exist for 2 characters and 1 character both.

``````public int romanToInt(String s) {
Map<String, Integer> map = new HashMap();
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);

map.put("IV", 4); map.put("IX", 9); map.put("XL", 40); map.put("XC", 90);
map.put("CD", 400); map.put("CM", 900);

int num = 0;
int l = s.length();
for (int i=0; i<l; ) {
String single = new String(new char[]{s.charAt(i)});
String two = null;
if (i+1 < l) {
two = new String(new char[]{s.charAt(i), s.charAt(i+1)});
}

if (two != null && map.get(two) != null) {
num += map.get(two);
i += 2;
}
else {
num += map.get(single);
i++;
}
}

return num;
}``````

## Similar Posts

### Find the maximum sum of any continuous subarray of size K

Introduction You are given an array of integers with size N, and a number K…

### Insertion Sort Algorithm

Its a kind of incremental insertion technique, where the algorithm build up…

### Binary Tree - Level Order Traversal

Problem Statement Given a Binary tree, print out nodes in level order traversal…

### How to calculate angle between hour and minute hand, given a time

This problem is a simple mathematical calculation. Lets start deriving some…

### How to calculate First Common Ancestor of two Nodes in Binary Tree

First try to understand question. Its a binary tree, not a binary search tree…

### Rotate Array - Leet Code Solution

Problem Statement Given an array, rotate the array to the right by k steps…

## Latest Posts

### Nextjs - How to Redirect to Another Page and Pass State

Introduction We have a page, for example a . And, upon submission we would want…

### How to Update Child Component State from Parent Component

Problem Statement I have a parent component which loads some list categories…

### How to use Draft.js WYSWYG with Next.js and Strapi Backend, Edit/Update Saved Article

Introduction This post is in contuation of our previous post: How to use Draft…

### How to use Draft.js WYSWYG with Next.js and Strapi Backend, Create and View Article with Image Upload

Introduction In this post, we will use in Next.js with strapi. And, we will…

### How to Integrate Next.js with Strapi Backend and Create a common utility class for REST APIs

Introduction In this post, we will integrate Next.js with Strapi fully. And we…

### Next.js - How to Get Session Information in Server Side vs Client Side iusing Next-auth

Introduction Next-auth is a fantastic library for abstracting handling of…