判断回文:双指针,栈
package P2.线性结构;
//判断回文数
public class JudgingPalindrom {
public static void main(String[] args) {
solution01();
System.out.println(solution02());
}
//双指针
private static boolean solution02() {
String text = "上海自来水来自海上";
int i = 0;
int j = 0;
while(true) {
if(text.charAt(i) == text.charAt(j)) {
i++;
j--;
}else{
return false;
}
if(j<=i){
return true;
}
}
}
//栈
private static void solution01() {
String text =