Pomelo Lee workspace

package com.i5a6.test;
 
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
 
public class TestPalindrome {
 
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		String str = "11223344中国中国国";
 
		// System.out.println(isPalindromeForLen(str));
		// System.out.println(isPalindromeForStringBuf(str));
		//System.out.println(isPalindromeForLenStringBuf(str));
		System.out.println(isInnerPalindrome(str));
 
	}
 
	/**
	 * 检测是否字符串长度不变情况下的任意组合可以出回文的检测方法 (即是否包含回文的混排) 
	 * ex:"11223344中国中国国"----->"中国1234国4321国中" return true
	 * 只是用2次循环1次排序，算是比较节省的
	 * @param str
	 * @return
	 */
	private static boolean isInnerPalindrome(String str) {
		if (str == null || str.length() == 1) {
			return false;
		}
		int len = str.length();
		List<Character> list = new ArrayList<Character>();
		for (int i = 0; i < len; i++) {
			list.add(str.charAt(i));
		}
		Collections.sort(list);
		int oddNum = 0;
		Character tempChar = null;
		int tempCnt = 0;
		for (int j = 0; j < len; j++) {
			char listC = list.get(j);
			boolean isChange = false;
			if (tempChar == null) {
				tempChar = listC;
			}
			if (tempChar.charValue() == listC) {
				tempCnt++;
			} else {
				if (tempCnt % 2 == 1) {
					oddNum++;
				}
				isChange = true;
				tempChar = listC;
				tempCnt = 1;
			}
 
			if ((j == (len - 1)) && (tempCnt % 2 == 1)) {
				oddNum++;
			}
			if ((isChange || (j == (len - 1))) && (oddNum > 1)) {
				return false;
			}
		}
 
		return true;
 
	}
 
	/**
	 * 尾部倒序比较法
	 * 
	 * @param str
	 * @return
	 */
	private static boolean isPalindromeForLenStringBuf(String str) {
		if (str == null || str.length() == 1) {
			return false;
		}
		int len = str.length();
		StringBuffer sb = new StringBuffer();
		for (int i = (len - 1); i >= 0; i--) {
			sb.append(str.charAt(i));
		}
		return str.equals(sb.toString());
	}
 
	/**
	 * 循环长度校验
	 * 
	 * @param str
	 * @return
	 */
	private static boolean isPalindromeForLen(String str) {
		if (str == null || str.length() == 1) {
			return false;
		}
		int len = str.length();
		for (int i = 0; i < len / 2; i++) {
			char first = str.charAt(i);
			char end = str.charAt(len - i - 1);
			if (first != end) {
				return false;
			}
		}
		return true;
	}
 
	/**
	 * 使用stringbuffer 检查是否为回文
	 * 
	 * @param str
	 * @return
	 */
	private static boolean isPalindromeForStringBuf(String str) {
		if (str == null || str.length() == 1) {
			return false;
		}
		StringBuffer sb = new StringBuffer(str);
		String rvStr = sb.reverse().toString();
		if (rvStr.equals(str)) {
			return true;
		}
		return false;
	}
 
}