wsy182
/
Solution
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

更新 test.java

master
wangsiyuan 2023-09-06 16:25:38 +08:00
parent 0eb5aa8e9e
commit 8f15fee32e
1 changed files with 11 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
src/solution/test.java
View File

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