思路:用递归的方法;第一步为判断0和最后一个字符是否一样
实现:
package palindrome;
public class Palindrome
{
/**
* @param args
*/
public static void main(String[] args)
{
// TODO Auto-generated method stub
// String testStr = "abcdedcba";
String testStr = "abcdecba";
System.out.println(testStr + " is palinedrome ? " + isPalinedrome(testStr, 0, testStr.length() - 1));
}
public static boolean isPalinedrome(String content, int startIndex, int endIndex)
{
if (startIndex >= endIndex)
return true;
if (content.charAt(startIndex) == content.charAt(endIndex))
return isPalinedrome(content, ++startIndex, --endIndex);
return false;
}
}
实现:
package palindrome;
public class Palindrome
{
/**
* @param args
*/
public static void main(String[] args)
{
// TODO Auto-generated method stub
// String testStr = "abcdedcba";
String testStr = "abcdecba";
System.out.println(testStr + " is palinedrome ? " + isPalinedrome(testStr, 0, testStr.length() - 1));
}
public static boolean isPalinedrome(String content, int startIndex, int endIndex)
{
if (startIndex >= endIndex)
return true;
if (content.charAt(startIndex) == content.charAt(endIndex))
return isPalinedrome(content, ++startIndex, --endIndex);
return false;
}
}