solve #3010: Divide an Array Into Subarrays With Minimum Cost I in java

Author: anishLearnsToCode

README.md

@@ -882,7 +882,7 @@
 | 2996 | [Smallest Missing Integer Greater Than Sequential Prefix Sum](https://leetcode.com/problems/smallest-missing-integer-greater-than-sequential-prefix-sum)               |                                                                    [![Java](assets/java.png)](src/SmallestMissingIntegerGreaterThanSequentialPrefixSum.java)                                                                     |                                                                                                                                   |
 | 3000 | [Maximum Area of Longest Diagonal Rectangle](https://leetcode.com/problems/maximum-area-of-longest-diagonal-rectangle)                                                 |                                                                            [![Java](assets/java.png)](src/MaximumAreaOfLongestDiagonalRectangle.java)                                                                            |                                                                                                                                   |
 | 3005 | [Count Elements With Maximum Frequency](https://leetcode.com/problems/count-elements-with-maximum-frequency)                                                           |                                                                              [![Java](assets/java.png)](src/CountElementsWithMaximumFrequency.java)                                                                              |                                                                                                                                   |
-| 3010 | [Divide an Array Into Subarrays With Minimum Cost I](https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-i)                                 |                                                                                                                                                                                                                                  |                                                                                                                                   |
+| 3010 | [Divide an Array Into Subarrays With Minimum Cost I](https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-i)                                 |                                                                         [![Java](assets/java.png)](src/DivideAnArrayIntoSubarraysWithMinimumCostI.java)                                                                          |                                                                                                                                   |
 | 3014 | [Minimum Number of Pushes to Type Word I](https://leetcode.com/problems/minimum-number-of-pushes-to-type-word-i)                                                       |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 3019 | [Number of Changing Keys](https://leetcode.com/problems/number-of-changing-keys)                                                                                       |                                                                                                                                                                                                                                  |                                                                                                                                   |
 | 3024 | [Type of Triangle](https://leetcode.com/problems/type-of-triangle)                                                                                                     |                                                                                                                                                                                                                                  |                                                                                                                                   |

src/DivideAnArrayIntoSubarraysWithMinimumCostI.java

@@ -0,0 +1,18 @@
+// https://leetcode.com/problems/divide-an-array-into-subarrays-with-minimum-cost-i
+// T: O(N)
+// S: O(1)
+
+public class DivideAnArrayIntoSubarraysWithMinimumCostI {
+    public int minimumCost(int[] array) {
+        int smallest = Integer.MAX_VALUE, secondSmallest = Integer.MAX_VALUE;
+        for (int i = 1 ; i < array.length ; i++) {
+            if (array[i] < smallest) {
+                secondSmallest = smallest;
+                smallest = array[i];
+            } else if (array[i] < secondSmallest) {
+                secondSmallest = array[i];
+            }
+        }
+        return array[0] + smallest + secondSmallest;
+    }
+}