验证回文串

验证回文串

package algorithm;

/**
 * 验证回文串 我的思路：先计算出字符串中字母和数字字符的数量，重新组成字符串，大写换为小写，分成前后字符串,后面逆序，然后比较前后字符串是否相同
 * 
 * @author Unique-cong
 *
 */
public class algorithm_7 {

	/**
	 * 我的解法：题目是做出来了，但是耗时太久
	 * 
	 * @param s
	 * @return
	 */
	public boolean isPalindrome(String s) {
		char[] strs = s.toCharArray();
		int count = 0;
		int j = 0;
		for (int i = 0; i < strs.length; i++) {
			if ((s.charAt(i) > 47 && s.charAt(i) < 58 || s.charAt(i) > 64
					&& s.charAt(i) < 91 || s.charAt(i) > 96
					&& s.charAt(i) < 123)) {
				count++;
			}
		}
		char[] str1 = new char[count];
		for (int i = 0; i < strs.length; i++) {
			if ((s.charAt(i) > 47 && s.charAt(i) < 58 || s.charAt(i) > 64
					&& s.charAt(i) < 91 || s.charAt(i) > 96
					&& s.charAt(i) < 123)) {
				if (strs[i] > 64 && strs[i] < 91) {
					strs[i] = (char) (strs[i] + 32);// 大写转换小写
				}
				str1[j] = strs[i];
				j++;
			}
		}
		j = 0;
		int p = str1.length / 2;
		char[] str2 = new char[p];
		char[] str3 = new char[p];
		for (int i = 0; i < p; i++) {
			str2[j] = str1[i];
			j++;
		}
		if (str1.length % 2 == 0) {// 偶数
			j = 0;
			for (int i = str1.length - 1; i >= p; i--) {
				str3[j] = str1[i];
				j++;
			}
		} else {
			j = 0;
			for (int i = str1.length - 1; i > p; i--) {
				str3[j] = str1[i];
				j++;
			}
		}
		String s1 = "";
		String s2 = "";
		for (int i = 0; i < str2.length; i++) {
			s1 = s1 + str2[i];
			s2 = s2 + str3[i];
		}
		if (s1.equals(s2)) {
			return true;
		} else {
			return false;
		}
	}

	/**
	 * 方法1：筛选 + 判断
	 * @param s
	 * @return
	 */
	public boolean isPalindrome_1(String s) {
		StringBuffer sgood = new StringBuffer();
		int length = s.length();
		for (int i = 0; i < length; i++) {
			char ch = s.charAt(i);
			if (Character.isLetterOrDigit(ch)) {//Character.isLetterOrDigit(char ch)，如果字符是字母或数字此方法返回true，否则为false。
				sgood.append(Character.toLowerCase(ch));//Character.toLowerCase(char ch)，大写转小写。
			}
		}
		StringBuffer sgood_rev = new StringBuffer(sgood).reverse();//.reverse 反转字符串
		return sgood.toString().equals(sgood_rev.toString());//比较两字符串大小
	}
	
	
	/**
	 * 方法2：使用双指针
	 * @param s
	 * @return
	 */
	public boolean isPalindrome_2(String s) {
        StringBuffer sgood = new StringBuffer();
        int length = s.length();
        for (int i = 0; i < length; i++) {
            char ch = s.charAt(i);
            if (Character.isLetterOrDigit(ch)) {
                sgood.append(Character.toLowerCase(ch));
            }
        }
        int n = sgood.length();
        int left = 0, right = n - 1;
        while (left < right) {
            if (Character.toLowerCase(sgood.charAt(left)) != Character.toLowerCase(sgood.charAt(right))) {
                return false;
            }
            ++left;
            --right;
        }
        return true;
    }

	public static void main(String[] args) {
		algorithm_7 a = new algorithm_7();
		System.out.println(a.isPalindrome("A man, a plan, a canal: Panama"));
	}
}