fd

Author: dingjikerbo

leetcode/solution/src/MedianOfTwoSortedArrays.java

@@ -24,7 +24,7 @@ private double findKth(int[] nums1, int start1, int end1, int[] nums2, int start
         if (len1 > len2) {
             return findKth(nums2, start2, end2, nums1, start1, end1, k);
         } else if (len1 == 0) {
-            return nums2[k - 1];
+            return nums2[start2 + k - 1];
         } else if (k == 1) {
             return Math.min(nums1[start1], nums2[start2]);
         }

leetcode/src/Main.java

@@ -2,69 +2,42 @@
 
 public class Main {
 
-    class LRUCache {
-
-        class Node {
-            Node prev, next;
-            int key, val;
-
-            Node(int key, int val) {
-                this.key = key;
-                this.val = val;
-                prev = next = this;
-            }
-
-            void remove() {
-                prev.next = next;
-                next.prev = prev;
-            }
-
-            void add(Node head) {
-                next = head.next;
-                head.next.prev = this;
-                prev = head;
-                head.next = this;
-            }
+    public double findMedianSortedArrays(int[] nums1, int[] nums2) {
+        int len1 = nums1.length;
+        int len2 = nums2.length;
+        int total = len1 + len2;
+        if (total % 2 == 0) {
+            return (findKth(nums1, nums2, 0, len1 - 1, 0, len2 - 1, total/2) +
+                    findKth(nums1, nums2, 0, len1 - 1, 0, len2 - 1, total/2 + 1))/2.0f;
+        } else {
+            return findKth(nums1, nums2, 0, len1 - 1, 0, len2 - 1, total/2 + 1);
         }
+    }
 
-        private Node mHead;
-        private HashMap<Integer, Node> mMap;
-        private int mCapacity;
-
-        public LRUCache(int capacity) {
-            mMap = new HashMap<>();
-            mCapacity = capacity;
-            mHead = new Node(0, 0);
+    public double findKth(int[] nums1, int[] nums2, int start1, int end1, int start2, int end2, int k) {
+        int len1 = end1 - start1 + 1;
+        int len2 = end2 - start2 + 1;
+        if (len1 > len2) {
+            return findKth(nums2, nums1, start2, end2, start1, end1, k);
         }
-
-        public int get(int key) {
-            if (!mMap.containsKey(key)) {
-                return -1;
-            }
-            Node node = mMap.get(key);
-            node.remove();
-            node.add(mHead);
-            return node.val;
+        if (len1 == 0) {
+            return nums2[start2 + k - 1];
         }
-
-        public void put(int key, int value) {
-            Node node = mMap.get(key);
-            if (node == null) {
-                node = new Node(key, value);
-                mMap.put(key, node);
-            } else {
-                node.val = value;
-                node.remove();
-            }
-            node.add(mHead);
-            if (mMap.size() > mCapacity) {
-                Node prev = mHead.prev;
-                prev.remove();
-                mMap.remove(prev.key);
-            }
+        if (k == 1) {
+            return Math.min(nums1[start1], nums2[start2]);
+        }
+        int ia = Math.min(k/2, len1);
+        int ib = k - ia;
+        if (nums1[start1 + ia - 1] > nums2[start2 + ib - 1]) {
+            return findKth(nums1, nums2, start1, end1, start2 + ib, end2, k - ib);
+        } else if (nums1[start1 + ia - 1] < nums2[start2 + ib - 1]) {
+            return findKth(nums1, nums2, start1 + ia, end1, start2, end2, k - ia);
+        } else {
+            return nums1[start1 + ia - 1];
         }
     }
 
+
     public static void main(String[] args) {
 
     }