题目描述:小明拿到了一个排列,最开始的排列顺字是(1,2,3.......n)即顺序排列。小明进行了k次操作,每次操作他选择一个区问{l,r]进行翻转。保证翻转的区间的起始点和终点都是非递减的,小明想知道,所有操作结中之后,排列顺序是什么?
import java.util.Scanner;
public class ali {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
String[] info = sc.nextLine().split(" ");
int n = Integer.parseInt(info[0]);
int k = Integer.parseInt(info[1]);
int[] number = new int [n];
for (int i = 0; i < n; i++) {
number[i] = i + 1;
}
for (int i = 0; i < k; i++) {
String[] lr = sc.nextLine().split(" ");
int l = Integer.parseInt(lr[0]);
int r = Integer.parseInt(lr[1]);
//确保起始点和终点非递减
if(number[l - 1] < number[r - 1]){
int tmp = number[l - 1];
number[l - 1] = number[r - 1];
number[r - 1] = tmp;
}
//剩下的翻转
if(l < r - 2)
reverse(number, l , r-2);
}
String s = "";
for (int i = 0; i < number.length - 1; i++) {
s = s + number[i] + " ";
}
s = s + number[number.length - 1];
System.out.println(s);
}
// 实现数组元素的翻转
public static void reverse(int[] number , int l, int r){
int a = l + (r-l) / 2;
// 遍历数组
for(int i = l; i <= l + (r-l) / 2;i++){
// 交换元素
int temp = number[r + (l-i)];
number[r + (l-i)] = number[i];
number[i] = temp;
}
}
}