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

更新 Solution.java

master
wangsiyuan 2023-09-05 17:44:34 +08:00
parent 49b6b07473
commit 4b4c9344b5
1 changed files with 27 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

34
src/solution/Solution.java
View File

@ -1,9 +1,7 @@
package solution;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;
import java.util.*;
import java.util.stream.Collectors;
public class Solution {
@ -81,8 +79,30 @@ public class Solution {
}
return candidate;
}
public void merge(int[] nums1, int m, int[] nums2, int n) {
//合并数组冒泡排序实现
public static void merge(int[] nums1, int m, int[] nums2, int n) {
int[] nums= new int[m + n];
for (int i = 0; i < m + n; i++) {
if (i < m){
nums[i] = nums1[i];
} else {
nums[i] = nums2[i - m];
}
}
// 冒泡排序
for (int i = 0; i < nums.length; i++) {
for (int j = 0; j < nums.length; j++) {
if (i != j) {
if (nums[i] < nums[j]){
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
}
}
}
}
nums1 = nums;
String result = Arrays.stream(nums1).mapToObj(String::valueOf).collect(Collectors.joining(",", "[", "]"));
System.out.println(result);
}
}