nyoj752 又见回文串 博弈

<span style="font-family: Arial, Helvetica, sans-serif; background-color: rgb(255, 255, 255);">题目：</span><a target=_blank href="http://acm.nyist.net/JudgeOnline/talking.php?pid=752" style="font-family: Arial, Helvetica, sans-serif; background-color: rgb(255, 255, 255);">点击打开链接</a>

题目分析：就是一个找规律的博弈问题，一定要理解“重新整理”。。。是可以调整顺序的。。。

然后找规律....

代码：

package 南阳;

import java.io.BufferedInputStream;
import java.io.PrintStream;
import java.util.Arrays;
import java.util.Scanner;

public class _752 {

	public static void main(String[] args) {
		Scanner in = new Scanner(new BufferedInputStream(System.in));
		PrintStream out = System.out;
		int cnt[] = new int[26], num;
		String input;
		while (in.hasNext()) {
			input = in.next();
			Arrays.fill(cnt, 0);
			num = 0;

			for (int i = 0, len = input.length(); i < len; i++) {
				cnt[input.charAt(i) - 'a']++;
			}
			for (int i = 0; i < 26; i++) {
				if ((cnt[i] & 1) == 1) {
					num++;
				}
			}
			out.println(((num & 1) == 0 || num <= 1) ? "Yes" : "No");
		}

		out.close();
		in.close();
	}
}