src/solution/Solution.java

@@ -105,24 +105,4 @@ public class Solution {
         String result = Arrays.stream(nums1).mapToObj(String::valueOf).collect(Collectors.joining(",", "[", "]"));
         System.out.println(result);
     }
-
-    public static String longestCommonPrefix(String[] strs) {
-        // ["flower","flow","flight"]
-        int maxPrefix = 0;
-        int index = 0;
-        StringBuilder temp = new StringBuilder();
-        if (strs != null){
-            for (int i = 0; i < strs.length; i++) {
-                if (strs[i] != ""){
-                    for (int j = 0; j < strs[i].length() && j < index; j++) {
-                        temp.append(strs[i].charAt(index));
-                        break;
-                    }
-                } else {
-                    return "";
-                }
-            }
-        }
-        return "";
-    }
 }

src/solution/test.java

@@ -8,18 +8,14 @@ import java.util.stream.Collectors;
 
 public class test {
     public static void main(String[] args) {
-//        int[] nums1 = new int[]{1,2,3,0,0,0};
-//        int m = 3;
-//        int[] nums2 = new int[]{2,5,6};
-//        int n = 3;
+        int[] nums1 = new int[]{1,2,3,0,0,0};
+        int m = 3;
+        int[] nums2 = new int[]{2,5,6};
+        int n = 3;
 //        int[] nums1 = new int[]{1};
 //        int m = 1;
 //        int[] nums2 = new int[]{};
 //        int n = 0;
-//        Solution.merge(nums1,m,nums2,n);
-        String[] strs = new String[]{"flower","flow","flight"};
-        String result =  Solution.longestCommonPrefix(strs);
-        System.out.println(result);
+        Solution.merge(nums1,m,nums2,n);
     }
-
 }