refactor 4

fishercoder1534 · fishercoder1534 · commit de8d5f574dfb · 2020-04-25T06:31:23.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_4.java b/src/main/java/com/fishercoder/solutions/_4.java
@@ -3,23 +3,6 @@
 import static java.lang.Math.max;
 import static java.lang.Math.min;
 
-/**
- 4. Median of Two Sorted Arrays
-
- There are two sorted arrays nums1 and nums2 of size m and n respectively.
-
- Find the median of the two sorted arrays. The overall run time complexity should be O(log (m+n)).
-
- Example 1:
- nums1 = [1, 3]
- nums2 = [2]
- The median is 2.0
-
- Example 2:
- nums1 = [1, 2]
- nums2 = [3, 4]
- The median is (2 + 3)/2 = 2.5
- */
 public class _4 {
 
     public static class Solution1 {
