判断字符串是否为回文

Java实现：

1.底层实现

        String str;
        char ch;
        Scanner sc = new Scanner(System.in);
        StringBuilder sb = new StringBuilder();
        StringBuilder substr1 = new StringBuilder();
        StringBuilder substr2 = new StringBuilder();
        str= sc.next();
        for (int i = 0; i < str.length(); i++){
            ch=str.charAt(i);
            if(ch>='A'&&ch<='Z'||ch>='a'&&ch<='z'||ch>='0'&&ch<='9'){
                sb.append(ch);
            }
        }
        int last =sb.length()-1;
        for (int i = 0; i<=last-i; i++) {      //核心代码
            substr1.append(sb.charAt(i));
            substr2.append(sb.charAt(last-i));
        }
        if(substr1.compareTo(substr2) == 0) System.out.println("是回文！");
        else System.out.println("不是回文！");

2.将字符串包装成StringBuilder对象再调用reverse取反

import java.util.Scanner;
public static void main(String[] args) {
        Scanner sc =new Scanner(System.in);
        String str=sc.next();
        StringBuilder sb=new StringBuilder(str);
        if (sb.reverse().toString().equals(str)){
            System.out.println(true);
        }
    }

输入为整形：

若指定输入的值为整形则可以采用如下算法：

#include<stdio.h>
int main(void)
{
	int i,j,k=0;
	printf("please input number:");
	scanf("%d",&i);
	j=i;
	while(j){
		k=k*10+j%10;   //将k构造为j的逆序
		j/=10;         //第一次i的取个位，第二次取十位...
	}
	if(k==i)
	printf("%d是回文数!",i);
	else
	printf("%d不是回文数!",i);
	return 0;
}