-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPalindrome.java
More file actions
84 lines (73 loc) · 2.95 KB
/
Copy pathPalindrome.java
File metadata and controls
84 lines (73 loc) · 2.95 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
package strings;
public class Palindrome {
public static void main(String[] args) {
// Simple Palindrome Check (Case-Sensitive)
String input = "madam";
boolean isPalindrome = isPalindrome(input);
System.out.println("Is \"" + input + "\" a palindrome? " + isPalindrome);
// Palindrome Check (Case-Insensitive, Ignore Spaces)
String input1 = "A man a plan a canal Panama";
boolean isPalindrome1 = isPalindromeIgnoreCase(input1);
System.out.println("Is \"" + input1 + "\" a palindrome? " + isPalindrome1);
// Using StringBuilder (Reversed String Comparison)
String input2 = "RaceCar";
boolean isPalindrome2 = isPalindromeWithStringBuilder(input2);
System.out.println("Is \"" + input2 + "\" a palindrome? " + isPalindrome2);
// Recursive Palindrome Check
String input3 = "madam";
boolean isPalindrome3 = isPalindromeRecursive(input.toLowerCase());
System.out.println("Is \"" + input3 + "\" a palindrome? " + isPalindrome3);
}
// Simple Palindrome Check (Case-Sensitive)
public static boolean isPalindrome(String input) {
int left = 0, right = input.length() - 1;
while (left < right) {
if (input.charAt(left) != input.charAt(right)) {
return false;
}
left++;
right--;
}
return true;
}
// Palindrome Check (Case-Insensitive, Ignore Spaces)
public static boolean isPalindromeIgnoreCase(String input1) {
String sanitized = input1.replaceAll("[^a-zA-Z0-9]", "").toLowerCase();
int left = 0, right = sanitized.length() - 1;
while (left < right) {
if (sanitized.charAt(left) != sanitized.charAt(right)) {
return false;
}
left++;
right--;
}
return true;
}
// Simple Palindrome Check (Case-Sensitive)
public static boolean isPalindromeWithStringBuilder(String input2) {
String sanitized = input2.replaceAll("[^a-zA-Z0-9]", "").toLowerCase();
String reversed = new StringBuilder(sanitized).reverse().toString();
return sanitized.equals(reversed);
}
// Recursive Palindrome Check
public static boolean isPalindromeRecursive(String input) {
if (input.length() <= 1) {
return true;
}
if (input.charAt(0) != input.charAt(input.length() - 1)) {
return false;
}
return isPalindromeRecursive(input.substring(1, input.length() - 1));
}
/*
* 1. Iterative Approach:
* • Time Complexity: O(n) (n is the length of the string)
* • Space Complexity: O(1) (constant space)
* 2. StringBuilder Approach:
* • Time Complexity: O(n)
* • Space Complexity: O(n) (for the reversed string)
* 3. Recursive Approach:
* • Time Complexity: O(n)
* • Space Complexity: O(n) (stack space due to recursion)
*/
}