更新 test.java

src/solution/test.java

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