add 1558

fishercoder1534 · fishercoder1534 · commit 1a945a6adc21 · 2020-08-22T10:01:50.000-07: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                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1558|[Minimum Numbers of Function Calls to Make Target Array](https://leetcode.com/problems/minimum-numbers-of-function-calls-to-make-target-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1558.java) ||Medium|Greedy|
 |1557|[Minimum Number of Vertices to Reach All Nodes](https://leetcode.com/problems/minimum-number-of-vertices-to-reach-all-nodes/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1557.java) ||Medium|Graph|
 |1556|[Thousand Separator](https://leetcode.com/problems/thousand-separator/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1556.java) ||Easy|String|
 |1551|[Minimum Operations to Make Array Equal](https://leetcode.com/problems/minimum-operations-to-make-array-equal/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1551.java) | [:tv:](https://youtu.be/A-i2sxmBqAA)|Medium|Math|
diff --git a/src/main/java/com/fishercoder/solutions/_1558.java b/src/main/java/com/fishercoder/solutions/_1558.java
@@ -0,0 +1,76 @@
+package com.fishercoder.solutions;
+
+import java.util.Arrays;
+
+public class _1558 {
+    public static class Solution1 {
+        public int minOperations(int[] nums) {
+            Arrays.sort(nums);
+            int ops = 0;
+            while (!allZero(nums)) {
+                if (allEvenAndNonZeroes(nums)) {
+                    nums = half(nums);
+                    ops++;
+                } else if (hasOdds(nums)) {
+                    int[] result = new int[nums.length];
+                    for (int i = 0; i < nums.length; i++) {
+                        if (nums[i] % 2 != 0) {
+                            result[i] = nums[i] - 1;
+                            ops++;
+                        } else {
+                            result[i] = nums[i];
+                        }
+                    }
+                    nums = result;
+                } else {
+                    int[] result = new int[nums.length];
+                    for (int i = 0; i < nums.length; i++) {
+                        if (nums[i] != 0) {
+                            result[i] = nums[i] / 2;
+                        } else {
+                            result[i] = nums[i];
+                        }
+                    }
+                    nums = result;
+                    ops++;
+                }
+            }
+            return ops;
+        }
+
+        private boolean hasOdds(int[] nums) {
+            for (int i : nums) {
+                if (i % 2 != 0) {
+                    return true;
+                }
+            }
+            return false;
+        }
+
+        private int[] half(int[] nums) {
+            int[] result = new int[nums.length];
+            for (int i = 0; i < nums.length; i++) {
+                result[i] = nums[i] / 2;
+            }
+            return result;
+        }
+
+        private boolean allEvenAndNonZeroes(int[] nums) {
+            for (int i : nums) {
+                if (i % 2 != 0 || i == 0) {
+                    return false;
+                }
+            }
+            return true;
+        }
+
+        private boolean allZero(int[] nums) {
+            for (int i : nums) {
+                if (i != 0) {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1558Test.java b/src/test/java/com/fishercoder/_1558Test.java
@@ -0,0 +1,48 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1558;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1558Test {
+    private static _1558.Solution1 solution1;
+    private static int[] nums;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1558.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        nums = new int[]{1, 5};
+        assertEquals(5, solution1.minOperations(nums));
+    }
+
+    @Test
+    public void test2() {
+        nums = new int[]{2, 2};
+        assertEquals(3, solution1.minOperations(nums));
+    }
+
+    @Test
+    public void test3() {
+        nums = new int[]{4, 2, 5};
+        assertEquals(6, solution1.minOperations(nums));
+    }
+
+    @Test
+    public void test4() {
+        nums = new int[]{3, 2, 2, 4};
+        assertEquals(7, solution1.minOperations(nums));
+    }
+
+    @Test
+    public void test5() {
+        nums = new int[]{2, 4, 8, 16};
+        assertEquals(8, solution1.minOperations(nums));
+    }
+
+}
