目录
练习07:定义一个4行4列的二维数组,逐个从键盘输入值,然后将第1行和第4行的数据进行交换,将第2行和第3行的数据进行交换
练习08:定义一个3行4列的二维数组,逐个从键盘输入值,编写程序将四周的数据清0
练习09:定义一个3行4列的二维数组,逐个从键盘输入值,将左下三角的值清0
练习10:定义一个4行4列的二维数组,逐个从键盘输入值,将对角线的值清0
练习11:定义一个N*N二维数组,从键盘上输入值,找出每行中最大值组成一个一维数组并输出。
练习12:从键盘上输入一个 3*4 的整型数组,求出其中的最大值和最小值,并显示输出
-
-
- /*
- * 练习07:定义一个4行4列的二维数组,逐个从键盘输入值,然后将第1行和第4行的数据进行交换,将第2行和第3行的数据进行交换
- */
- public static void main(String[] args) {
-
- int[][] nums = new int[4][4];
-
- Scanner sc = new Scanner(System.in);
-
- for (int i = 0; i < nums.length; i++) {
- for (int j = 0; j < nums[i].length; j++) {
- System.out.println("请输入二维数组里第" + (i + 1) + "个元素里的第" + (j + 1) + "个值:");
- nums[i][j] = sc.nextInt();
- }
- }
-
- System.out.println("您输入的二维数组是:");
- for (int[] is : nums) {
- for (int i : is) {
- System.out.print(i + " ");
- }
- System.out.println();
- }
-
- for (int i = 0; i < nums.length; i++) {
- for (int j = 0; j < nums.length; j++) {
- if (i == 0) {
- int temp = nums[i][j];
- nums[i][j] = nums[3][j];
- nums[3][j] = temp;
- } else if (i == 1) {
- int temp = nums[i][j];
- nums[i][j] = nums[2][j];
- nums[2][j] = temp;
- }
- }
- }
-
- System.out.println("\n交换后的二维数组是:");
- for (int[] is : nums) {
- for (int i : is) {
- System.out.print(i + " ");
- }
- System.out.println();
- }
-
- sc.close();
-
- }
-
-
-
- /*
- * 练习08:定义一个3行4列的二维数组,逐个从键盘输入值,编写程序将四周的数据清0
- */
- public static void main(String[] args) {
-
- int[][] nums = new int[3][4];
-
- Scanner sc = new Scanner(System.in);
-
- for (int i = 0; i < nums.length; i++) {
- for (int j = 0; j < nums[i].length; j++) {
- System.out.println("请输入二维数组里第" + (i + 1) + "个元素里的第" + (j + 1) + "个值:");
- nums[i][j] = sc.nextInt();
- }
- }
-
- System.out.println("您输入的二维数组是:");
- for (int[] is : nums) {
- for (int i : is) {
- System.out.print(i + " ");
- }
- System.out.println();
- }
-
- for (int i = 0; i < nums.length; i++) {
- for (int j = 0; j < nums[i].length; j++) {
- if ((i == 0) || (i == 2) || (i == 1 && j == 0) || (i == 1 & j == 3)) {
- nums[i][j] = 0;
- }
- }
- }
-
- System.out.println("\n四周的数据清0后数组是:");
- for (int[] is : nums) {
- for (int i : is) {
- System.out.print(i + " ");
- }
- System.out.println();
- }
-
- sc.close();
-
- }
-
-
-
- /*
- * 练习09:定义一个3行4列的二维数组,逐个从键盘输入值,将左下三角的值清0
- */
- public static void main(String[] args) {
-
- int[][] nums = new int[3][4];
-
- Scanner sc = new Scanner(System.in);
-
- for (int i = 0; i < nums.length; i++) {
- for (int j = 0; j < nums[i].length; j++) {
- System.out.println("请输入二维数组里第" + (i + 1) + "个元素里的第" + (j + 1) + "个值:");
- nums[i][j] = sc.nextInt();
- }
- }
-
- System.out.println("您输入的二维数组是:");
- for (int[] is : nums) {
- for (int i : is) {
- System.out.print(i + " ");
- }
- System.out.println();
- }
-
- for (int i = 0; i < nums.length; i++) {
- for (int j = 0; j < nums[i].length; j++) {
- if ((i == 1 && j == 0) || (i == 2 && j == 0) || (i == 2 && j == 1)) {
- nums[i][j] = 0;
- }
- }
- }
-
- System.out.println("\n左下三角的值清0后数组是:");
- for (int[] is : nums) {
- for (int i : is) {
- System.out.print(i + " ");
- }
- System.out.println();
- }
-
- sc.close();
-
- }
-
-
-
- /*
- * 练习10:定义一个4行4列的二维数组,逐个从键盘输入值,将对角线的值清0
- */
- public static void main(String[] args) {
-
- int[][] nums = new int[4][4];
-
- Scanner sc = new Scanner(System.in);
-
- for (int i = 0; i < nums.length; i++) {
- for (int j = 0; j < nums[i].length; j++) {
- System.out.println("请输入二维数组里第" + (i + 1) + "个元素里的第" + (j + 1) + "个值:");
- nums[i][j] = sc.nextInt();
- }
- }
-
- System.out.println("您输入的二维数组是:");
- for (int[] is : nums) {
- for (int i : is) {
- System.out.print(i + " ");
- }
- System.out.println();
- }
-
- for (int i = 0; i < nums.length; i++) {
- for (int j = 0; j < nums[i].length; j++) {
- if ((i == j) || (i + j == 3)) {
- nums[i][j] = 0;
- }
- }
- }
-
- System.out.println("\n对角线的值清0后数组是:");
- for (int[] is : nums) {
- for (int i : is) {
- System.out.print(i + " ");
- }
- System.out.println();
- }
-
- sc.close();
-
- }
-
-
-
- /*
- * 练习11:定义一个N*N二维数组,从键盘上输入值,找出每行中最大值组成一个一维数组并输出。
- */
- public static void main(String[] args) {
-
- Scanner sc = new Scanner(System.in);
-
- System.out.println("请输入你想要创建的数组长度:");
- int length = sc.nextInt();
-
- int[][] nums = new int[length][length];
-
- for (int i = 0; i < nums.length; i++) {
- for (int j = 0; j < nums[i].length; j++) {
- System.out.println("请输入二维数组中第" + (i + 1) + "个元素的第" + (j + 1) + "个值:");
- nums[i][j] = sc.nextInt();
- }
- }
-
- System.out.println("您输入的数组是:");
- for (int[] is : nums) {
- for (int i : is) {
- System.out.print(i + " ");
- }
- System.out.println();
- }
-
- int[] newNums = new int[length];
-
- for (int i = 0; i < nums.length; i++) {
- int max = nums[i][0];
- for (int j = 0; j < nums[i].length; j++) {
- if (nums[i][j] > max) {
- max = nums[i][j];
- }
- }
- newNums[i] = max;
- }
-
- System.out.println("每行中最大值组成的一个一维数组是:");
- System.out.println(Arrays.toString(newNums));
-
- sc.close();
-
- }
-
-
-
- /*
- * 练习12:从键盘上输入一个 3*4 的整型数组,求出其中的最大值和最小值,并显示出
- */
- public static void main(String[] args) {
-
- int[][] nums = new int[3][4];
-
- Scanner sc = new Scanner(System.in);
-
- for (int i = 0; i < nums.length; i++) {
- for (int j = 0; j < nums[i].length; j++) {
- System.out.println("请输入二维数组里第" + (i + 1) + "个元素里的第" + (j + 1) + "个值:");
- nums[i][j] = sc.nextInt();
- }
- }
-
- System.out.println("您输入的二维数组是:");
- for (int[] is : nums) {
- for (int i : is) {
- System.out.print(i + " ");
- }
- System.out.println();
- }
-
- int max = nums[0][0];
- int min = nums[0][0];
-
- for (int i = 0; i < nums.length; i++) {
- for (int j = 0; j < nums.length; j++) {
- if (nums[i][j] > max) {
- max = nums[i][j];
- }
-
- if (nums[i][j] < min) {
- min = nums[i][j];
- }
- }
- }
-
- System.out.println("数组中的最大值是:" + max);
- System.out.println("数组中的最小值是:" + min);
-
- sc.close();
-
- }
-
-
-
- /*
- * 练习13:有10个数字要求分别用选择法和冒泡法从大到小输出
- */
- public static void main(String[] args) {
-
- // 选择法
- int[] nums = { 9, 34, 87, 24, 76, 12, 55, 28, 80, 90 };
- System.out.println("排序前数组:");
- System.out.println(Arrays.toString(nums));
-
- for (int i = 0; i < nums.length - 1; i++) {
- int minIndex = i; // 用来记录最小值的索引位置,默认值为i
- for (int j = i + 1; j < nums.length; j++) {
- if (nums[j] < nums[minIndex]) {
- minIndex = j; // 遍历 i+1~length 的值,找到其中最小值的位置
- }
- }
- // 交换当前索引 i 和最小值索引 minIndex 两处的值
- if (i != minIndex) {
- int temp = nums[i];
- nums[i] = nums[minIndex];
- nums[minIndex] = temp;
- }
- // 执行完一次循环,当前索引 i 处的值为最小值,直到循环结束即可完成排序
- }
-
- System.out.println("排序后数组:");
- System.out.println(Arrays.toString(nums));
- }
-
-
-
- /*
- * 练习13:有10个数字要求分别用选择法和冒泡法从大到小输出
- */
- public static void main(String[] args) {
-
- // 冒泡法
- int[] nums = { 9, 34, 87, 24, 76, 12, 55, 28, 80, 90 };
- System.out.println("排序前数组:");
- System.out.println(Arrays.toString(nums));
-
- for (int i = 0; i < nums.length - 1; i++) {
- for (int j = 0; j < nums.length - 1 - i; j++) {
- if (nums[j] < nums[j + 1]) {
- int temp = nums[j];
- nums[j] = nums[j + 1];
- nums[j + 1] = temp;
- }
- }
- }
-
- System.out.println("排序后数组:");
- System.out.println(Arrays.toString(nums));
-
- }
-