Java之数列求逆序数

public class MatrixInNu {
public static int InverseNumber(String MatrixOne){
	int Count=0;
	for(int i=1;i<MatrixOne.length();i++)
	{
		for(int j=0;j<i;j++)
		{
		  int a=(int)(MatrixOne.charAt(i));
		  int b=(int)(MatrixOne.charAt(j));
		  if(a<b)
		  {
			  Count++;
		  }
		}
	}
	return Count;
}
public static void main(String[]args)//测试
{
	String One="123456789";
	String Two="987654321";
	String Three="673293973";
		
	  String strr=String.valueOf(InverseNumber(One));
	 String strr2=String.valueOf(InverseNumber(Two));
	 String strr3=String.valueOf(InverseNumber(Three));
	
   System.out.println(strr);
   System.out.println(strr2);
   System.out.println(strr3);
  
	
}

}