-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSolution_isPalindrome2.java
65 lines (61 loc) · 1.38 KB
/
Solution_isPalindrome2.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
60
61
62
63
64
65
package com.bupt.kcrosswind.Leetcode;
public class Solution_isPalindrome2 {
public static boolean isPalindrome(String s) {
char[] reslut = new char[s.length()];
int j = 0;
for (int i = 0; i < s.length(); i++) {
if (s.charAt(i) <= 'z' && s.charAt(i) >= 'a') {
reslut[j] = s.charAt(i);
j++;
} else if (s.charAt(i) <= 'Z' && s.charAt(i) >= 'A') {
reslut[j] = (char) (s.charAt(i) + 32);
j++;
} else if (s.charAt(i) <= '9' && s.charAt(i) >= '0') {
reslut[j] = s.charAt(i);
j++;
}
}
for (int i = 0; i < j; i++) {
if (reslut[i] != reslut[j - 1]) {
return false;
}
j--;
}
return true;
}
public boolean isPalindrome2(String s) {
for (int i = 0, j = s.length() - 1; i < j;) {
if (alphanumeric(s.charAt(i)) == ' ') {
i++;
} else if (alphanumeric(s.charAt(j)) == ' ') {
j++;
} else {
if (alphanumeric(s.charAt(i)) != alphanumeric(s.charAt(j))) {
return false;
}
i++;
j++;
}
}
return true;
}
public char alphanumeric(char c) {
if (c <= 'z' && c >= 'a') {
return c;
} else if (c <= 'Z' && c >= 'A') {
return (char) (c + 32);
} else if (c <= '9' && c >= '0') {
return c;
}
return ' ';
}
public static void main(String[] args) {
Character c = 'a';
Character c1 = 'A';
if (c > c1) {
System.out.println(c - c1);
}
String s = "Bab";
System.out.println(isPalindrome(s));
}
}