Googleok
diff --git a/‎src/leetcode/easy/maximum_subarray.java‎
Lines changed: 22 additions & 0 deletions b/‎src/leetcode/easy/maximum_subarray.java‎
Lines changed: 22 additions & 0 deletions
diff --git a/‎src/leetcode/easy/search_insert_position.java‎
Lines changed: 19 additions & 0 deletions b/‎src/leetcode/easy/search_insert_position.java‎
Lines changed: 19 additions & 0 deletions
@@ -0,0 +1,22 @@
+package leetcode.easy;
+
+/**
+ * https://leetcode.com/problems/maximum-subarray/
+ */
+public class maximum_subarray {
+    public static void main(String[] args) {
+        int[] nums = {-2, 1, -3, 4, -1, 2, 1, -5, 4};
+        System.out.println(maxSubArray(nums));
+    }
+
+    static public int maxSubArray(int[] nums) {
+        int max = Integer.MIN_VALUE;
+        int sum = 0;
+        for (int i = 0; i < nums.length; i++) {
+            sum += nums[i];
+            if (max < sum) max = sum;
+            if (sum < 0) sum = 0;
+        }
+        return max;
+    }
+}
@@ -0,0 +1,19 @@
+package leetcode.easy;
+
+import java.util.Arrays;
+
+/**
+ * https://leetcode.com/problems/search-insert-position
+ */
+public class search_insert_position {
+    public static void main(String[] args) {
+        int[] nums = {1, 3, 5, 6};
+        int target = 7;
+        System.out.println(searchInsert(nums, target));
+    }
+
+    static public int searchInsert(int[] nums, int target) {
+        int searchedIdx = Arrays.binarySearch(nums, target);
+        return searchedIdx < 0 ? Math.abs(searchedIdx) - 1 : searchedIdx;
+    }
+}