回文数的几种算法

个人编写的低效率的算法

public static void main(String[] args) {
		// TODO Auto-generated method stub
		int i,n,x,sum=0;
		System.out.println("请输入一个介于1~99999的整数");
		Scanner sc = new Scanner(System.in);
		String st = sc.next();
		int len = st.length();
		int m = len;
		int a = Integer.parseInt(st);
		int b =a;
		System.out.print(a+"为"+len+"位数");
		for(i = 0;i0)
		{
		    sum = sum*10 + b%10; 
		    b/=10;
		}
		if(sum==a)
		{
			System.out.println(",是回文数");
		}
		else
		{
			System.out.println(",不是回文数");
		}
	}
}
0)
		{
		    sum = sum*10 + b%10; 
		    b/=10;
		}
		if(sum==a)
		{
			System.out.println(",是回文数");
		}
		else
		{
			System.out.println(",不是回文数");
		}
	}
}