AcWing 818. 数组排序
原题链接
困难
作者:
最后五分钟
,
2024-03-04 17:39:59
,
所有人可见
,
阅读 14
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt(), l = sc.nextInt(), r = sc.nextInt();
int w[] = new int[n];
for (int i = 0; i < n; i++) w[i] = sc.nextInt();
sort(w, l, r);
for (int i = 0; i < n; i++)
System.out.printf("%d ", w[i]);
}
private static void sort(int w[], int l, int r) {
for (int i = l; i <= r; i++) {
for (int j = l; j < r; j++) {
if (w[j] > w[j + 1]) {
int t = w[j];
w[j] = w[j + 1];
w[j + 1] = t;
}
}
}
}
}