University:
California State University, Northridge
Course:
COMP 110/L | Introduction to Algorithms and Programming and Lab
Academic year:

2024
Views:

318

Pages:

1
Author:

rdespairqq7

public class RecursivePalindromeUsingSubstring { public static boolean isPalindrome(String s) { if (s.length() <= 1) // Base case return true; else if (s.charAt(0) != s.charAt(s.length() - 1)) // Base case return false; else return isPalindrome(s.substring(1, s.length() - 1)); } public static void main(String[] args) { System.out.println("Is moon a palindrome? " + isPalindrome("moon")); System.out.println("Is noon a palindrome? " + isPalindrome("noon")); System.out.println("Is a a palindrome? " + isPalindrome("a")); System.out.println("Is aba a palindrome? " + isPalindrome("aba")); System.out.println("Is ab a palindrome? " + isPalindrome("ab")); } }