-
Notifications
You must be signed in to change notification settings - Fork 62
/
Solution.java
59 lines (54 loc) · 1.92 KB
/
Solution.java
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
package g0101_0200.s0125_valid_palindrome;
// #Easy #Top_Interview_Questions #String #Two_Pointers #Udemy_Two_Pointers
// #2022_06_23_Time_3_ms_(98.64%)_Space_43.2_MB_(81.23%)
public class Solution {
public boolean isPalindrome(String s) {
int i = 0;
int j = s.length() - 1;
boolean res = true;
while (res) {
// Iterates through string to find first char which is alphanumeric.
// Done to ignore non-alphanumeric characters.
// Starts from 0 to j-1.
while (i < j && isNotAlphaNumeric(s.charAt(i))) {
i++;
}
// Similarly from j-1 to 0.
while (i < j && isNotAlphaNumeric(s.charAt(j))) {
j--;
}
// Checks if i is greater than or equal to j.
// The main loop only needs to loop n / 2 times hence this condition (where n is string
// length).
if (i >= j) {
break;
}
// Assigning found indices to variables.
// The upperToLower function is used to convert characters, if upper case, to lower
// case.
// If already lower case, it'll return as it is.
char left = upperToLower(s.charAt(i));
char right = upperToLower(s.charAt(j));
// If both variables are not same, result becomes false, and breaks out of the loop at
// next iteration.
if (left != right) {
res = false;
}
i++;
j--;
}
return res;
}
private boolean isNotAlphaNumeric(char c) {
return (c < 'a' || c > 'z') && (c < 'A' || c > 'Z') && (c < '0' || c > '9');
}
private boolean isUpper(char c) {
return c >= 'A' && c <= 'Z';
}
private char upperToLower(char c) {
if (isUpper(c)) {
c = (char) (c + 32);
}
return c;
}
}