String Palindrome using Recursion - Java
public class IsPalindromeUsingRecursion {
public static boolean isPal(String s){
if(s.length() == 1 || s.length() == 0)
return true;
if(s.charAt(0) != s.charAt(s.length()-1)){
return false;
}
return isPal(s.substring(1, s.length() - 1));
}
public static void main(String[] args) {
System.out.println(isPal("manam"));
}
}
Output: true
public static boolean isPal(String s){
if(s.length() == 1 || s.length() == 0)
return true;
if(s.charAt(0) != s.charAt(s.length()-1)){
return false;
}
return isPal(s.substring(1, s.length() - 1));
}
public static void main(String[] args) {
System.out.println(isPal("manam"));
}
}
Output: true
Comments
Post a Comment