String 反向字符串回文
嗨,我正在尝试反转字符串以生成回文。有人能给我一个关于如何反转字符串的教程吗?我在网上读过一些教程,并尝试将它们应用到我正在编写的回文程序中,但没有成功String 反向字符串回文,string,reverse,String,Reverse,嗨,我正在尝试反转字符串以生成回文。有人能给我一个关于如何反转字符串的教程吗?我在网上读过一些教程,并尝试将它们应用到我正在编写的回文程序中,但没有成功 import java.util.Random; public class IterativePalindromGenerator { public static void main(String[] args) { Random random = new Random(); int floorV
import java.util.Random;
public class IterativePalindromGenerator {
public static void main(String[] args) {
Random random = new Random();
int floorValue = 1;
int cielingValue = 20;
int randomNumber = random.nextInt(cielingValue - floorValue)
+ floorValue;
String alphabetLetters = "abcdefghijklmnopqrstuvwxyz";
for (int i = 0; i < randomNumber; i++) {
char generatedLetters = alphabetLetters.charAt(random
.nextInt(alphabetLetters.length()));
String generatedLetterSTRINGType = Character
.toString(generatedLetters);// converts char to string
System.out.print(generatedLetterSTRINGType);
}
}
}
import java.util.Random;
公共类迭代回文生成器{
公共静态void main(字符串[]args){
随机=新随机();
int floorValue=1;
int cielingValue=20;
int randomNumber=random.nextInt(cielingValue-floorValue)
+地价;
字符串alphabetLetters=“abcdefghijklmnopqrstuvxyz”;
对于(int i=0;i
要反转字符串,可以使用StringBuffers reverse()方法:
为现有字符串创建回文时,需要考虑偶数和奇数结果字符串的情况。例如,如果您输入字符串“abc”,您应该期望有两个结果回文字符串:abccba(偶数)和abcba(奇数) 这是我的密码:
public class PalindromeGenerator {
public static void main(String[] args) {
String str = "abc";
String reverse_str = "";
for (int n = str.length(); n>0; n--){
reverse_str += str.substring(n-1, n);
}
String even_str = str + reverse_str;
String odd_str = str.substring(0, str.length()-1) + reverse_str;
System.out.println(even_str); // print "abccba"
System.out.println(odd_str); //print "abcba"
}
}
我希望这能帮助你 嘿,这是我大学课程的代码。我们的任务是实现一个递归过程。希望这能对社会有所帮助
package DiskreteMathe;
import java.util.*;
public class AufgabePalindromTestRekursiv {
public static void main (String[] args){
Scanner sc = new Scanner(System.in);
System.out.println("Please enter text here:");
String text= sc.next();
System.out.println(testPalindrom(text));
}
public static boolean testPalindrom (String text){
if (text.length()==2 && text.charAt(0)==text.charAt(1) || text.length()==1)
return true;
if(text.charAt(0)!=text.charAt(text.length()-1)){
return false;
} else {
text = text.substring(1, text.length()-1);
return testPalindrom(text);
}
}
}
[检查此链接并相应更改为回文。][1][1]:
package DiskreteMathe;
import java.util.*;
public class AufgabePalindromTestRekursiv {
public static void main (String[] args){
Scanner sc = new Scanner(System.in);
System.out.println("Please enter text here:");
String text= sc.next();
System.out.println(testPalindrom(text));
}
public static boolean testPalindrom (String text){
if (text.length()==2 && text.charAt(0)==text.charAt(1) || text.length()==1)
return true;
if(text.charAt(0)!=text.charAt(text.length()-1)){
return false;
} else {
text = text.substring(1, text.length()-1);
return testPalindrom(text);
}
}
}