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

Binary Tree - Level Order Traversal

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

Leetcode - Maximum Non Negative Product in a Matrix

Problem Statement You are given a rows x cols matrix grid. Initially, you are…

Single Number - Leet Code Solution

Problem Statement Given a non-empty array of integers, every element appears…

Rotate Image - Leet Code Solution

Problem Statement You are given an n x n 2D matrix representing an image, rotate…

Counting Sort Algorithm

Counting sort runs on relatively smaller set of input. Counting sort calculates…

System design interview is pretty common these days, specially if you are having…

Latest Posts

Jenkins Pipeline with Jenkinsfile - How To Schedule Job on Cron and Not on Code Commit

Introduction In this post we will see following: How to schedule a job on cron…

How to Git Clone Another Repository from Jenkin Pipeline in Jenkinsfile

Introduction There are some cases, where I need another git repository while…

How to Fetch Multiple Credentials and Expose them in Environment using Jenkinsfile pipeline

Introduction In this post, we will see how to fetch multiple credentials and…

Jenkins Pipeline - How to run Automation on Different Environment (Dev/Stage/Prod), with Credentials

Introduction I have an automation script, that I want to run on different…

Jenkinsfile - How to Create UI Form Text fields, Drop-down and Run for Different Conditions

Introduction I had to write a CICD system for one of our project. I had to…

Java Log4j Logger - Programmatically Initialize JSON logger with customized keys in json logs

Introduction Java log4j has many ways to initialize and append the desired…