Question

在给定的句子中，将每个单词反向并在句子中打印反向单词。如果有回文，请打印这些单词。如果没有回文，请打印“无回文”。这就是我写的

import java.util.Scanner;   
public class main{   
    public static void main(String[] args){     
        Scanner input=new Scanner(System.in);  
        String s1=input.nextLine();   
        String arr[]=s1.split("\\s",s1.length());   
        int count=0;    
        String palindrome[]=new String[s1.length()];    

        for(int i=0;i<arr.length;i++){



             String s2="";
          for(int j=arr[i].length()-1;j>=0;j--){
          s2=s2.concat(Character.toString(arr[i].charAt(j)));
          System.out.println(arr[i].charAt(j));
          }
          System.out.print(" ");
          if(arr[i].equals(s2)){
              count++;
              palindrome[i]=s2;
          }

        }

        if(count>0){
             for(String i:palindrome)
             System.out.println(i);}
             else 
             System.out.println("Not a palindrome");
        }

    }

但是代码没有给出正确的输出。

Answer 1

这应该有效：

public static void main(String[] args) {
    Scanner input = new Scanner(System.in);
    String s1 = input.nextLine();
    String[] arr = s1.split(" ");
    StringBuilder output = new StringBuilder();
    for (String currentWord : arr) {
        String reverseWord = new StringBuilder(currentWord).reverse().toString();
        if (currentWord.equals(reverseWord)) {
            output.append(reverseWord);
        } else {
            output.append("No Palindrome ");
        }
    }
    System.out.println(output);
}

Answer 2

这是一个有效的code，可用于检查input string/number是palindrome还是not palindrome

代码：

    import java.util.*;
    class stackOverflow {

        public static void main(String[] args) {
            String original, reverse = ""; // Objects of String class  
            Scanner in = new Scanner(System.in);   
            System.out.println("Enter a string/number to check if it is a palindrome or not:");  
            // takes input string
            original = in.nextLine();   
            int length = original.length();   // length of the string to do iteration on it
            // check the string from the end to the start to reverse it
            // read and append it with the reverse variable in backward
            for ( int i = length - 1; i >= 0; i-- )  
               reverse = reverse + original.charAt(i);

            // Finally we check if the input string and reversed string
            if (original.equals(reverse))  
               System.out.println("Is palindrome.");  
            else  
               System.out.println("Not palindrome.");   
         }
    }

I've edited your code and now it's working fine:

  import java.util.*;
    class stackOverflow {
        public static void main(String[] args){     
            Scanner input=new Scanner(System.in);  
            String s1=input.nextLine();   
            String arr[]=s1.split("\\s",s1.length());   

            for(int i=0;i<arr.length;i++){

              String s2="";
              for(int j=arr[i].length()-1;j>=0;j--){
              s2=s2.concat(Character.toString(arr[i].charAt(j)));
              //System.out.println(arr[i].charAt(j));
              }
              //System.out.print(" ");
              if(arr[i].equals(s2)){
                  //palindrome[i]=s2; // you are inserting the s2 value into the first element of the array, 
                  //so the rest of the positions remains empty/null that's not a problem to solve palindrome

                System.out.println("Is a palindrome");
              }
              else 
                 System.out.println("Not a palindrome");
            }

        }
    }

希望它能帮助您，编写愉快的代码

Answer 3

这是一种较短的方法：

seq(min(Value), max(Value))

检查句子中的每个单词是否都是回文

3 个答案: