UVa 401 Palindromes

最新推荐文章于 2022-01-24 22:44:28 发布

原创最新推荐文章于 2022-01-24 22:44:28 发布 · 337 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一个Java程序，该程序使用字符处理技巧来判断输入字符串是否为回文，并进一步检查其是否为镜像字符串或镜像回文。通过使用Scanner类读取输入，程序实现了对普通回文及经过特定字符映射后的镜像回文的识别。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

本题展现了JAVA字符处理的强大能力

import java.util.Scanner;

public class Main {
  public static void main(String[] args) {
    Scanner cin = new Scanner(System.in);
    while (cin.hasNextLine()) {
      String s = cin.nextLine();
      String ss = new String(s);
      System.out.print(s);
      String s1 = new String(new StringBuffer(s).reverse().toString());
      boolean flag = true, flag1 = true;
      for (int i = 0; i < s.length(); i++) {
        if (s1.charAt(i) != s.charAt(i)) {
          flag = false;
          break;
        }
      }
      char[] a = s.toCharArray();
      String old = "ABCDEFGHIJKLMNOPQRSTUVWXYZ12345678";
      String now = "A   3  HIL JM O   2TUVWXY 1SE Z  8";
      for (int i = 0; i < a.length; i++) {
        char ch = now.charAt(old.indexOf(a[i]));
        if (ch != ' ') {
          a[i] = ch;
        }else {
          flag1 = false;
          break;
        }
      }
      if (flag1) {
        s = String.valueOf(a);
        String s2 = new String(new StringBuffer(s).reverse().toString());
        for (int i = 0; i < ss.length(); i++) {
          if (s2.charAt(i) != ss.charAt(i)) {
            flag1 = false;
            break;
          }
        }
      }
      if (!flag && !flag1) System.out.println(" -- is not a palindrome.");
      if (flag && !flag1) System.out.println(" -- is a regular palindrome.");
      if (!flag && flag1) System.out.println(" -- is a mirrored string.");
      if (flag && flag1) System.out.println(" -- is a mirrored palindrome.");
      System.out.print('\n');
    }
  }
}