Commitdbebab0

authored

Merge pull requestTheAlgorithms#720 from pandeyarun709/TheAlgo

Add Roman To Integer conversion

2 parents53b2b69 +971d5f7 commitdbebab0Copy full SHA for dbebab0

File tree

+56

-0

lines changed

+56

-0

lines changed

Lines changed: 56 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,56 @@`
	`1`	`+importjava.util.*;`
	`2`	`+`
	`3`	`+publicclassRomanToInteger {`
	`4`	`+`
	`5`	`+privatestaticMap<Character,Integer>map =newHashMap<>() {{`
	`6`	`+put('I',1);`
	`7`	`+put('V',5);`
	`8`	`+put('X',10);`
	`9`	`+put('L',50);`
	`10`	`+put('C',100);`
	`11`	`+put('D',500);`
	`12`	`+put('M',1000);`
	`13`	`+ }};`
	`14`	`+`
	`15`	`+/**`
	`16`	`+ * This function convert Roman number into Integer`
	`17`	`+ *`
	`18`	`+ * @param A Roman number string`
	`19`	`+ * @return integer`
	`20`	`+ */`
	`21`	`+publicstaticintromanToInt(StringA) {`
	`22`	`+`
	`23`	`+charprev =' ';`
	`24`	`+`
	`25`	`+intsum =0;`
	`26`	`+`
	`27`	`+intnewPrev =0;`
	`28`	`+for (inti =A.length() -1;i >=0;i--) {`
	`29`	`+charc =A.charAt(i);`
	`30`	`+`
	`31`	`+if (prev !=' ') {`
	`32`	`+// checking current Number greater then previous or not`
	`33`	`+newPrev =map.get(prev) >newPrev ?map.get(prev) :newPrev;`
	`34`	`+ }`
	`35`	`+`
	`36`	`+intcurrentNum =map.get(c);`
	`37`	`+`
	`38`	`+// if current number greater then prev max previous then add`
	`39`	`+if (currentNum >=newPrev) {`
	`40`	`+sum +=currentNum;`
	`41`	`+ }else {`
	`42`	`+// subtract upcoming number until upcoming number not greater then prev max`
	`43`	`+sum -=currentNum;`
	`44`	`+ }`
	`45`	`+`
	`46`	`+prev =c;`
	`47`	`+ }`
	`48`	`+`
	`49`	`+returnsum;`
	`50`	`+ }`
	`51`	`+`
	`52`	`+publicstaticvoidmain(String[]args) {`
	`53`	`+intsum =romanToInt("MDCCCIV");`
	`54`	`+System.out.println(sum);`
	`55`	`+ }`
	`56`	`+}`

Comments

(0)