蓝桥杯算法提高VIP-交换Easy-(非)题解（Java代码）

解题思路:

注意事项:

参考代码:

public static void main(String[] args) {

// TODO Auto-generated method stub

Scanner scanner=new Scanner(System.in);

int lenth=scanner.nextInt();

int counter=scanner.nextInt();

System.out.println();

if ((1>lenth||lenth>1000)||(1>counter||counter>1000)) {

System.out.println("输入超限");

return;

}

int[]numbers=new int[lenth];

for (int i = 0; i < lenth; i++) {

numbers[i]=scanner.nextInt();

}

for (int i = 0; i < counter; i++) {

int x=scanner.nextInt();

int y=scanner.nextInt();

System.out.println();

if (x<1||y>lenth) {

System.out.println("值超限");

return;

}

if (x==y) {

continue;

}

int num=0;

int index=0;

int num2;

for (int j = 0; j < numbers.length; j++) {

if (x==numbers[j]) {

if (num==0) {

index=j;

num=numbers[j];

}

else {

num2=numbers[j];

numbers[j]=num;

numbers[index]=num2;

}

}

else if (y==numbers[j]) {

if (num==0) {

index=j;

num=numbers[j];

}

else {

num2=numbers[j];

numbers[j]=num;

numbers[index]=num2;

}

}

}

}

for (int i = 0; i < numbers.length; i++) {

System.out.println(numbers[i]);

}

}