LeetCode 125. 验证回文串 java

说明：本题中，我们将空字符串定义为有效的回文串。

示例 1:

输入: "A man, a plan, a canal: Panama"
输出: true

示例 2:

输入: "race a car"
输出: false

JAVA 代码：

class Solution {
	public boolean isPalindrome(String s) {
		int n1 = s.length();
		StringBuilder sb = new StringBuilder();
		for (int i = 0; i < n1; i++) {
			char c = s.charAt(i);
			if (isLetterAndNum(c)) {
				sb.append(c);
			}
		}
		char[] ch = sb.toString().toLowerCase().toCharArray();
		int n = ch.length;
		int x = 0, y = n - 1;
		while (x < y) {
			if (ch[x++] != ch[y--]) {
				return false;
			}
		}
		return true;
	}

	public boolean isLetterAndNum(char ch) {
        // return String.valueOf(ch).matches("^[a-zA-Z0-9]+$");
		if (ch <= 'z' && ch >= 'a') {
			return true;
		} else if (ch <= 'Z' && ch >= 'A') {
			return true;
		} else if (ch <= '9' && ch >= '0') {
			return true;
		}
		return false;
	}

}