更新 test.java

src/solution/test.java

@@ -17,7 +17,9 @@ public class test {
 //        int[] nums2 = new int[]{};
 //        int n = 0;
 //        Solution.merge(nums1,m,nums2,n);
-        String[] strs = new String[]{"flower","flow","flight"};
+//        String[] strs = new String[]{"flower","flow","flight"};
+        String[] strs = new String[]{"abcg","abcecar","abr"};
+
         String result =  Solution.longestCommonPrefix(strs);
         System.out.println(result);
     }