package csdnDay11_3;
import java.util.Scanner;
public class inversion {
static int length=0;
static int a []=new int [100];
public static void inverdionfound(int a[])
{
for(int i=0;i<length;i++)
{
for(int j=i+1;j<length;j++)
{
if(a[i]>a[j])
{
System.out.println("("+a[i]+","+a[j]+")");
}
}
}
}
public static void main(String[] args) {
Scanner sc =new Scanner(System.in);
System.out.println("请输入数组的长度");
length=sc.nextInt();
System.out.println("请输入数组的数值");
for(int i=0;i<length;i++)
{
a[i]=sc.nextInt();
}
System.out.println("您输入的数组为:");
for(int i=0;i<length;i++)
{
System.out.print(a[i]+", ");
}
System.out.println();
System.out.println("其中包含的逆序数对为:");
inverdionfound(a);
}
}
Inversion 逆序对
最新推荐文章于 2021-12-07 22:08:52 发布