任意位数的数字逆序输出
import java.util.Scanner;
public class NiXu {
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner sc=new Scanner(System.in);
System.out.println("请输入一个整数:");
int num=sc.nextInt();
niXu(num);
}
private static void niXu(int num) {
// TODO Auto-generated method stub
while(num>0) {
System.out.print(num%10);
num/=10;
}
}
}
冒泡排序(优化后)
public class PaiXu {
public static void main(String[] args) {
// TODO Auto-generated method stub
int a[]= {32,23,12,43,24,25,54,36,6,64,1,3};
int sorta []=maoPao(a);
for(int n:sorta) {
System.out.print(n+" < ");
}
}
private static int[] maoPao(int[] a) {
// TODO Auto-generated method stub
for(int i=0;i<a.length-1;i++) {
for(int j=0;j<a.length-1-i;j++) {
if(a[j]>a[j+1]) {
int temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
return a;
}
}