fix

Author: cdToucher

src/me/codebase/leetcode/_004.java

@@ -1,7 +1,5 @@
 package me.codebase.leetcode;
 
-import java.util.Arrays;
-
 /**
  * Created by chendong on 2018/1/2.
  */
@@ -14,8 +12,44 @@ public static void main(String[] args) {
         int[] C = {1, 2, 3, 4, 4, 5, 6, 8, 9, 10};
         // 4.5
 
+        Solution solution = new Solution();
+        double median = solution.findMedianSortedArrays(A, B);
+        System.out.println(median);
 //        System.out.println(findMedianSortedArrays(A, B));
     }
 
+    private static double findMedian(int[] A, int[] B){
+
+
+
+        return 0;
+    }
+
+
+    static class Solution {
+        public double findMedianSortedArrays(int[] nums1, int[] nums2) {
+            int len = nums1.length + nums2.length;
+            if (len % 2 == 0) {
+                return (helper(nums1, 0, nums2, 0, len / 2) + helper(nums1, 0, nums2, 0, len / 2 + 1)) / 2.0;
+            }
+            return helper(nums1, 0, nums2, 0, (len + 1) / 2);
+        }
+
+        private int helper(int[] nums1, int m, int[] nums2, int n, int k) {
+            if (m >= nums1.length) return nums2[n + k - 1];
+            if (n >= nums2.length) return nums1[m + k - 1];
+            if (k == 1) return Math.min(nums1[m], nums2[n]);
+
+            int p1 = m + k / 2 - 1;
+            int p2 = n + k / 2 - 1;
+            int mid1 = p1 < nums1.length ? nums1[p1] : Integer.MAX_VALUE;
+            int mid2 = p2 < nums2.length ? nums2[p2] : Integer.MAX_VALUE;
+            if (mid1 < mid2) {
+                return helper(nums1, m + k / 2, nums2, n, k - k / 2);
+            }
+            return helper(nums1, m, nums2, n + k / 2, k - k / 2);
+        }
+    }
+
 
 }

src/me/codebase/leetcode/_554.java

@@ -0,0 +1,49 @@
+package me.codebase.leetcode;
+
+import java.util.ArrayList;
+import java.util.List;
+
+/**
+ * Created by chendong on 2018/1/5.
+ */
+public class _554 {
+
+    /*
+    input:
+    [[1,2,2,1],
+ [3,1,2],
+ [1,3,2],
+ [2,4],
+ [3,1,2],
+ [1,3,1,1]]
+    output:
+    2
+     */
+
+    public static void main(String[] args) {
+        List<Integer[]> input = new ArrayList<>();
+        input.add(new Integer[]{1, 2, 2, 1});
+        input.add(new Integer[]{3, 1, 2});
+        input.add(new Integer[]{1, 3, 2});
+        input.add(new Integer[]{2, 4});
+        input.add(new Integer[]{3, 1, 2});
+        input.add(new Integer[]{1, 3, 1, 1});
+        solution(input);
+    }
+
+    private static int solution(List<Integer[]> input) {
+        int result = 0;
+        List<Integer[]> points = new ArrayList<>(input.size());
+        for (Integer[] breaks : input) {
+            List<Integer> list = new ArrayList<>();
+            int point = 0;
+            for (Integer integer : breaks) {
+                point += integer;
+                list.add(point);
+            }
+            points.add(list.toArray(new Integer[list.size()]));
+        }
+
+        return result;
+    }
+}