refactor 4

fishercoder1534 · fishercoder1534 · commit 45a57d058820 · 2019-09-26T07:26:27.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_4.java b/src/main/java/com/fishercoder/solutions/_4.java
@@ -22,7 +22,7 @@ The median is (2 + 3)/2 = 2.5
  */
 public class _4 {
 
-    class Solution1 {
+    public static class Solution1 {
         /**credit: https://discuss.leetcode.com/topic/28602/concise-java-solution-based-on-binary-search
          *
          * The key point of this problem is to ignore half part of A and B each step recursively by comparing the median of remaining A and B:
@@ -68,7 +68,7 @@ public double getkth(int[] A, int aStart, int[] B, int bStart, int k) {
         }
     }
 
-    class Solution2 {
+    public static class Solution2 {
         /**
          * Reference: https://leetcode.com/discuss/28843/my-accepted-java-solution:
          * Basic Idea is very similar to K-selection. it's easier to understand if you imagine this to be chopping off the last K elements from a total of len(A) + len(B) elements,

Original file line number	Diff line number	Diff line change
`@@ -22,7 +22,7 @@ The median is (2 + 3)/2 = 2.5`
`22`	`22`	`*/`
`23`	`23`	`public class _4 {`
`24`	`24`
`25`		`- class Solution1 {`
	`25`	`+ public static class Solution1 {`
`26`	`26`	`/**credit: https://discuss.leetcode.com/topic/28602/concise-java-solution-based-on-binary-search`
`27`	`27`	`*`
`28`	`28`	`* The key point of this problem is to ignore half part of A and B each step recursively by comparing the median of remaining A and B:`
`@@ -68,7 +68,7 @@ public double getkth(int[] A, int aStart, int[] B, int bStart, int k) {`
`68`	`68`	`}`
`69`	`69`	`}`
`70`	`70`
`71`		`- class Solution2 {`
	`71`	`+ public static class Solution2 {`
`72`	`72`	`/**`
`73`	`73`	`* Reference: https://leetcode.com/discuss/28843/my-accepted-java-solution:`
`74`	`74`	`* Basic Idea is very similar to K-selection. it's easier to understand if you imagine this to be chopping off the last K elements from a total of len(A) + len(B) elements,`