java 回文串判断

	public static void main(String[] args){
		java.util.Stack<Character> stackchar = new java.util.Stack<Character>();
		Scanner cin = new Scanner(System.in);
		char[] reverse = null;
		reverse = cin.next().toCharArray();
		if(reverse.length % 2 == 0){
			for(int i = 0; i < reverse.length; i++){
				if(stackchar.empty())
					stackchar.push(reverse[i]);
				else if(stackchar.peek() == reverse[i]){
					stackchar.pop();
				}else{
					stackchar.push(reverse[i]);
				}			
			}
		}
		else{
			for(int i = 0; i < reverse.length; i++){
				if(i == reverse.length / 2)
					continue;
				else{
					if(stackchar.empty())
						stackchar.push(reverse[i]);
					else if(stackchar.peek() == reverse[i]){
						stackchar.pop();
					}else{
						stackchar.push(reverse[i]);
					}		
				}
			}
		}
		if(stackchar.empty())
			System.out.println("是回文");
		else
			System.out.println("不是回文");
	}
}