add 1526

fishercoder1534 · fishercoder1534 · commit 2bd1d57c5467 · 2020-07-25T10:39:31.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                   
 |-----|----------------|---------------|--------|-------------|-------------
+|1526|[Minimum Number of Increments on Subarrays to Form a Target Array](https://leetcode.com/problems/minimum-number-of-increments-on-subarrays-to-form-a-target-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1526.java) | |Hard|Segment Tree|
 |1525|[Number of Good Ways to Split a String](https://leetcode.com/problems/number-of-good-ways-to-split-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1525.java) | |Medium|String, Bit Manipulation|
 |1524|[Number of Sub-arrays With Odd Sum](https://leetcode.com/problems/number-of-sub-arrays-with-odd-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1524.java) | |Medium|Array, Math|
 |1523|[Count Odd Numbers in an Interval Range](https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1523.java) | |Easy|Math|
diff --git a/src/main/java/com/fishercoder/solutions/_1526.java b/src/main/java/com/fishercoder/solutions/_1526.java
@@ -0,0 +1,32 @@
+package com.fishercoder.solutions;
+
+public class _1526 {
+    public static class Solution1 {
+        /**
+         * This brute force solution results in TLE on LeetCode.
+         */
+        public int minNumberOperations(int[] target) {
+            int ops = 0;
+            while (!allZero(target)) {
+                int i = 0;
+                while (target[i] == 0) {
+                    i++;
+                }
+                for (; i < target.length && target[i] != 0; i++) {
+                    target[i]--;
+                }
+                ops++;
+            }
+            return ops;
+        }
+
+        private boolean allZero(int[] target) {
+            for (int i : target) {
+                if (i != 0) {
+                    return false;
+                }
+            }
+            return true;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1526Test.java b/src/test/java/com/fishercoder/_1526Test.java
@@ -0,0 +1,32 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1526;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.TestCase.assertEquals;
+
+public class _1526Test {
+    private static _1526.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1526.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(3, solution1.minNumberOperations(new int[]{1, 2, 3, 2, 1}));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(4, solution1.minNumberOperations(new int[]{3, 1, 1, 2}));
+    }
+
+    @Test
+    public void test3() {
+        assertEquals(7, solution1.minNumberOperations(new int[]{3, 1, 5, 4, 2}));
+    }
+
+}
