import java.util.Scanner; public class one5 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int[] list1 = {1, 3, 5, 7, 9}; int[] list2 = {2, 4, 6, 8, 10}; int sum = getsum(list1, list2);//总长度 int[] list3 = new int[list1.length + list2.length]; for (int i = 0; i < list1.length; i++) { list3[i] = list1[i]; } for (int i = 0; i < list3.length - list1.length; i++) { list3[list3.length - list1.length + i ] = list2[i]; } for (int i = 0; i < list3.length; i++) { System.out.println(list3[i]); } int n = list3.length; for (int i = 0; i < list3.length; i++) {//外层循环次数,等于数组长度 for (int j = 0; j < list3.length - (i + 1); j++) {//内层循环次数,每次冒泡确定一个最大数在数组末尾,每次内层循环比较次数少1 int middle;//中间变量 if (list3[j] > list3[j + 1]) {//冒泡交换顺序 middle = list3[j]; list3[j] = list3[j + 1]; list3[j + 1] = middle; } } } for (int i = 0; i < list3.length; i++) {//循环赋值并取出 System.out.println(list3[i]); } if (sum%2!=0){ System.out.println(list3[list3.length/2]); }else { System.out.println((list3[list3.length/2]+list3[(list3.length/2)-1])/2); } } private static int getsum(int[] list1, int[] list2) { return list1.length + list2.length; } }
763. 划分字母区间 - 力扣(LeetCode)
2024-07-14 01:06:04 37 阅读