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

更新 Solution.java

master
wangsiyuan 2023-09-05 18:11:31 +08:00
parent bf2e20cde9
commit 22bc22261f
1 changed files with 16 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
src/solution/Solution.java
View File

@ -81,28 +81,29 @@ public class Solution {
}
//合并数组冒泡排序实现
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];
}
}
System.arraycopy(nums2, 0, nums1, m, n);
// 冒泡排序
for (int i = 0; i < nums.length; i++) {
for (int j = 0; j < nums.length; j++) {
for (int i = 0; i < nums1.length; i++) {
for (int j = 0; j < nums1.length; j++) {
if (i != j) {
if (nums[i] < nums[j]){
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;
if (nums1[i] < nums1[j]){
int temp = nums1[i];
nums1[i] = nums1[j];
nums1[j] = temp;
}
}
}
}
nums1 = nums;
String result = Arrays.stream(nums1).mapToObj(String::valueOf).collect(Collectors.joining(",", "[", "]"));
System.out.println(result);
}
public static int removeElement(int[] nums, int val) {
for (int i = 0; i < nums.length; i++) {
if (val == nums[i]){
}
}
return nums.length;
}
}