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             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.

Example 1:

Input: "III"
Output: 3

Example 2:

Input: "IV"
Output: 4

Example 3:

Input: "IX"
Output: 9

Example 4:

Input: "LVIII"
Output: 58
Explanation: L = 50, V= 5, III = 3.

Example 5:

Input: "MCMXCIV"
Output: 1994 

Explanation: M = 1000, CM = 900, XC = 90 and IV = 4.


Solution:


Time Complexity: O(n)

Space Complexity: O(1)

 



Comments

Post a Comment

Popular posts from this blog

Longest Common Prefix

-
Write a function to find the longest common prefix string amongst an array of strings. If there is no common prefix, return an empty string  "" . Example 1: Input: ["flower","flow","flight"] Output: "fl" Example 2: Input: ["dog","racecar","car"] Output: "" Explanation: There is no common prefix among the input strings. Note: All given inputs are in lowercase letters  a-z . Solution: The requirement here is to find longest common prefix amongst an array of strings.  There are many approaches to this problem but the one that I am going to discuss here uses Trie to store the array of strings and then scan the trie to get the longest common prefix. To know more about Trie, you can visit here . Algorithm: 1) Store each string from the array of strings in Trie. 2) Get the deepest Trie Node such that all the nodes from the root of the trie to that node has only one children. Space Complexity: O(n) ...
Read more

Two Sum

-
Given an array of integers, return   indices   of the two numbers such that they add up to a specific target. You may assume that each input would have  exactly  one solution, and you may not use the  same  element twice. Example: Given nums = [2, 7, 11, 15], target = 9, Because nums[ 0 ] + nums[ 1 ] = 2 + 7 = 9, return [ 0 , 1 ]. Solution: Since for each element 'x' present in the array, we will have to check whether a number 'y' exists in the array such that sum of two numbers is target and return indices of the number.  We can also say that, for any element 'x' present in the array , find a number 'target-x' which is also present in the array. One approach to the problem is to scan the complete array for finding number 'target-x' for each element 'x'.  Another approach is to use dictionaries. For each element 'x' in the array, check whether the dictionary contains element 'target-x'. So here, first we will scan the...
Read more