题解 | #冒泡排序#
冒泡排序
https://www.nowcoder.com/practice/83ef53227d654df28c18fd6a377e8fee
import java.util.Arrays; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner scanner = new Scanner(System.in); int[] arr = new int[7]; for (int i = 0; i < arr.length; i++) { arr[i] = scanner.nextInt(); } scanner.close(); //write your code here...... for (int i = arr.length - 1; i > 0; i--) { for (int j = 0; j < i; j++) { if (arr[j] > arr[j + 1]) { swap(arr,j,j+1); } } } for (int k = 0; k < arr.length; k++) { System.out.print(arr[k] + " "); } } // 定义一个值交换的方法 public static void swap(int[] arr, int i, int j) { arr[i] = arr[i] ^ arr[j]; arr[j] = arr[i] ^ arr[j]; arr[i] = arr[i] ^ arr[j]; } }