Add romanToInteger submitions

cediackermann/challenges/houseRobber/Solution.java

@@ -1,6 +1,5 @@
 package cediackermann.challenges.houseRobber;
 
-
 class Solution {
     public int rob(int[] nums) {
         int n = nums.length;
@@ -12,9 +11,7 @@ class Solution {
         loot[1] = Math.max(nums[0], nums[1]);
         for (int i = 2; i < n; i++) {
             loot[i] = Math.max(loot[i - 1], nums[i] + loot[i - 2]);
-            System.out.println(loot[i]);
         }
-
         return loot[n - 1];
     }
 }

cediackermann/challenges/romanToInt/BUILD

@@ -4,7 +4,7 @@ package(default_visibility = ["//visibility:public"])
 
 java_binary(
     name = "romanToInt",
-    main_class = "cediackermann.challenges.houseRobber.Main",
+    main_class = "cediackermann.challenges.romanToInt.Main",
     srcs = glob(["*.java"]),
     deps = [
     ],

cediackermann/challenges/romanToInt/Solution.java

@@ -5,7 +5,8 @@ import java.util.Map;
 
 class Solution {
     private final Map<String, Integer> romanLetters = new HashMap<>();
-    public Solution(){
+
+    public Solution() {
         romanLetters.put("I", 1);
         romanLetters.put("V", 5);
         romanLetters.put("X", 10);
@@ -14,17 +15,20 @@ class Solution {
         romanLetters.put("D", 500);
         romanLetters.put("M", 1000);
     }
+
     public int romanToInt(String s) {
         int solution = 0;
         for (int i = 0; i < s.length(); i++) {
             if (i + 1 <= s.length() - 1) {
-                if (this.romanLetters.get(Character.toString(s.charAt(i))) < this.romanLetters.get(Character.toString(s.charAt(i + 1)))) {
-                    solution += this.romanLetters.get(Character.toString(s.charAt(i+1))) - this.romanLetters.get(Character.toString(s.charAt(i)));
+                if (this.romanLetters.get(Character.toString(s.charAt(i))) < this.romanLetters
+                        .get(Character.toString(s.charAt(i + 1)))) {
+                    solution += this.romanLetters.get(Character.toString(s.charAt(i + 1)))
+                            - this.romanLetters.get(Character.toString(s.charAt(i)));
                     i++;
-                } else{
+                } else {
                     solution += this.romanLetters.get(Character.toString(s.charAt(i)));
                 }
-            } else{
+            } else {
                 solution += this.romanLetters.get(Character.toString(s.charAt(i)));
             }
         }

cediackermann/challenges/romanToInt2/BUILD

@@ -0,0 +1,11 @@
+load("@rules_java//java:defs.bzl", "java_binary")
+
+package(default_visibility = ["//visibility:public"])
+
+java_binary(
+    name = "romanToInt2",
+    main_class = "cediackermann.challenges.romanToInt2.Main",
+    srcs = glob(["*.java"]),
+    deps = [
+    ],
+)

cediackermann/challenges/romanToInt2/Main.java

@@ -0,0 +1,10 @@
+package cediackermann.challenges.romanToInt2;
+
+public class Main {
+    public static void main(String[] args) {
+        Solution sol = new Solution();
+        System.out.println(
+                sol.romanToInt("MCMXCIV"));
+    }
+
+}

cediackermann/challenges/romanToInt2/Solution.java

@@ -0,0 +1,31 @@
+package cediackermann.challenges.romanToInt2;
+
+import java.util.HashMap;
+import java.util.Map;
+
+class Solution {
+    private final Map<Character, Integer> romanLetters = new HashMap<>();
+
+    public Solution() {
+        romanLetters.put('I', 1);
+        romanLetters.put('V', 5);
+        romanLetters.put('X', 10);
+        romanLetters.put('L', 50);
+        romanLetters.put('C', 100);
+        romanLetters.put('D', 500);
+        romanLetters.put('M', 1000);
+    }
+
+    public int romanToInt(String s) {
+        int solution = 0;
+        for (int i = 0; i < s.length() - 1; i++) {
+            if (this.romanLetters.get(s.charAt(i)) < this.romanLetters.get(s.charAt(i + 1))) {
+                solution -= this.romanLetters.get(s.charAt(i));
+            } else {
+                solution += this.romanLetters.get(s.charAt(i));
+
+            }
+        }
+        return solution + romanLetters.get(s.charAt(s.length() - 1));
+    }
+}

cediackermann/challenges/romanToInt3/BUILD

@@ -0,0 +1,11 @@
+load("@rules_java//java:defs.bzl", "java_binary")
+
+package(default_visibility = ["//visibility:public"])
+
+java_binary(
+    name = "romanToInt3",
+    main_class = "cediackermann.challenges.romanToInt3.Main",
+    srcs = glob(["*.java"]),
+    deps = [
+    ],
+)

cediackermann/challenges/romanToInt3/Main.java

@@ -0,0 +1,10 @@
+package cediackermann.challenges.romanToInt3;
+
+public class Main {
+    public static void main(String[] args) {
+        Solution sol = new Solution();
+        System.out.println(
+                sol.romanToInt("MCMXCIV"));
+    }
+
+}

cediackermann/challenges/romanToInt3/Solution.java

@@ -0,0 +1,37 @@
+package cediackermann.challenges.romanToInt3;
+
+import java.util.HashMap;
+import java.util.Map;
+
+class Solution {
+    private final Map<Character, Integer> romanLetters = new HashMap<>();
+
+    public Solution() {
+        romanLetters.put('I', 1);
+        romanLetters.put('V', 5);
+        romanLetters.put('X', 10);
+        romanLetters.put('L', 50);
+        romanLetters.put('C', 100);
+        romanLetters.put('D', 500);
+        romanLetters.put('M', 1000);
+    }
+
+    public int romanToInt(String s) {
+        int solution = 0;
+        for (int i = 0; i < s.length(); i++) {
+            if (i + 1 <= s.length() - 1) {
+                if (this.romanLetters.get(s.charAt(i)) < this.romanLetters
+                        .get(s.charAt(i + 1))) {
+                    solution += this.romanLetters.get(s.charAt(i + 1))
+                            - this.romanLetters.get(s.charAt(i));
+                    i++;
+                } else {
+                    solution += this.romanLetters.get(s.charAt(i));
+                }
+            } else {
+                solution += this.romanLetters.get(s.charAt(i));
+            }
+        }
+        return solution;
+    }
+}