add 2154

fishercoder1534 · fishercoder1534 · commit 83dbeb49bbc0 · 2022-01-29T22:04:10.000-08:00
diff --git a/README.md b/README.md
@@ -8,6 +8,7 @@ _If you like this project, please leave me a star._ &#9733;
 
 |  #  |      Title     |   Solutions   | Video  | Difficulty  | Tag                  
 |-----|----------------|---------------|--------|-------------|-------------
+|2154|[Keep Multiplying Found Values by Two](https://leetcode.com/problems/keep-multiplying-found-values-by-two/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2154.java) ||Easy||
 |2150|[Find All Lonely Numbers in the Array](https://leetcode.com/problems/find-all-lonely-numbers-in-the-array/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2150.java) ||Medium||
 |2149|[Rearrange Array Elements by Sign](https://leetcode.com/problems/rearrange-array-elements-by-sign/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2149.java) ||Medium||
 |2148|[Count Elements With Strictly Smaller and Greater Elements](https://leetcode.com/problems/count-elements-with-strictly-smaller-and-greater-elements/)|[Java](../master/src/main/java/com/fishercoder/solutions/_2148.java) ||Easy||
diff --git a/src/main/java/com/fishercoder/solutions/_2154.java b/src/main/java/com/fishercoder/solutions/_2154.java
@@ -0,0 +1,19 @@
+package com.fishercoder.solutions;
+
+import java.util.HashSet;
+import java.util.Set;
+
+public class _2154 {
+    public static class Solution1 {
+        public int findFinalValue(int[] nums, int original) {
+            Set<Integer> set = new HashSet<>();
+            for (int num : nums) {
+                set.add(num);
+            }
+            while (set.contains(original)) {
+                original *= 2;
+            }
+            return original;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_2145Test.java b/src/test/java/com/fishercoder/_2145Test.java
@@ -0,0 +1,67 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._2145;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _2145Test {
+    private static _2145.Solution1 solution1;
+    private static int[] differences;
+    private static int lower;
+    private static int upper;
+    private static int expected;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _2145.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        differences = new int[]{1, -3, 4};
+        lower = 1;
+        upper = 6;
+        expected = 2;
+        assertEquals(expected, solution1.numberOfArrays(differences, lower, upper));
+    }
+
+    @Test
+    public void test2() {
+        differences = new int[]{3, -4, 5, 1, -2};
+        lower = -4;
+        upper = 5;
+        expected = 4;
+        assertEquals(expected, solution1.numberOfArrays(differences, lower, upper));
+    }
+
+    @Test
+    public void test3() {
+        differences = new int[]{4, -7, 2};
+        lower = 3;
+        upper = 6;
+        expected = 0;
+        assertEquals(expected, solution1.numberOfArrays(differences, lower, upper));
+    }
+
+    @Test
+    public void test4() {
+        differences = new int[]{-97793, 95035, 79372, -41294, -90060, -57485, 28899, -83385, -64425};
+        lower = -99340;
+        upper = -1477;
+        expected = 0;
+        assertEquals(expected, solution1.numberOfArrays(differences, lower, upper));
+    }
+
+    @Test
+    public void test5() {
+        differences = new int[]{23263, -3868, -24260, -11705};
+        lower = -26206;
+        upper = 23564;
+        expected = 9938;
+        assertEquals(expected, solution1.numberOfArrays(differences, lower, upper));
+    }
+
+
+}
