判断一个数是否是回文数

判断某个正整数是否为奇数位的回文数。(比如说1234321,1234554321)

判断字符串是否对称

public static void HuiWenShu() {
		Scanner sc = new Scanner(System.in);
		do {
			System.out.println("请输入一个字符串");
			String str = sc.nextLine();
			boolean flag = true;
			for (int i = 0; i < str.length(); i++) {
				if (str.charAt(i) == str.charAt(str.length() - 1 - i)) {
					flag = true;
				} else {
					flag = false;
				}
			}
			if (flag == true) {
				System.out.println(str + "对称");
			} else {
				System.out.println(str + "不对称");
			}
		} while (true);
	}

判断回文数

package com.hisoft.java.exercises;

import java.util.Scanner;
import java.util.concurrent.SynchronousQueue;

public class HuiWenShu {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		boolean flag = true;
		do {
			System.out.print("请输入一个整数:");
			int num = sc.nextInt();
			String str = String.valueOf(num);
			System.out.println(str);
			int strLength = str.length();
			System.out.println("num的位数" + strLength);
			for (int i = 0; i < str.length(); i++) {
				if (str.charAt(i) == str.charAt(strLength - 1 - i)) {
					if (strLength % 2 == 0) {
						System.out.println(num + "是偶数位回文数");
						break;
					} else {
						System.out.println(num + "是奇数位回文数");
						break;
					}
				} else {
					System.out.println(num + "不是回文数");
					break;
				}
			}
			System.out.println("是否继续<y/n>");
			String str1 = sc.next();
			if (str1.equals("y")) {
				flag = true;
			} else {
				flag = false;
			}
		} while (flag);

	}
}