/
Solution125.java
55 lines (45 loc) · 1.56 KB
/
Solution125.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
public class Solution125 {
public boolean isPalindrome(String s) {
boolean pal = true;
int left = 0;
int right = s.length() - 1;
int vleft, vright;
while(left < right) {
while(left < s.length()
&& (s.charAt(left) < 'a' || s.charAt(left) > 'z')
&& (s.charAt(left) < 'A' || s.charAt(left) > 'Z')
&& (s.charAt(left) < '0' || s.charAt(left) > '9')) {
left++;
}
while(right >= 0
&& (s.charAt(right) < 'a' || s.charAt(right) > 'z')
&& (s.charAt(right) < 'A' || s.charAt(right) > 'Z')
&& (s.charAt(right) < '0' || s.charAt(right) > '9')) {
right--;
}
if(left >= s.length() || right < 0) {
if(!(left >= s.length() && right < 0)) {
pal = false;
}
break;
}
if(s.charAt(left) >= 'a') {
vleft = s.charAt(left) - 'a' + 'A';
} else {
vleft = s.charAt(left);
}
if(s.charAt(right) >= 'a') {
vright = s.charAt(right) - 'a' + 'A';
} else {
vright = s.charAt(right);
}
if(vleft != vright) {
pal = false;
break;
}
left++;
right--;
}
return pal;
}
}