Java-POJ1013-Counterfeit Dollar

在13枚硬币中找出fake的那一个

输入：三次天平称量结果

 package poj.ProblemSet;

 import java.util.Scanner;

 /*
 我怎么觉得是贪心算法呢？
 起初对所有硬币标记0；
 如果是even，则两边所有的硬币记为真(记233)；
 否则就对不确定的硬币记录怀疑(++或者--根据天平倾斜方向)；
 最后只要看哪个硬币的绝对值最大，也就是被怀疑的次数最多，即是假币。
  */
 public class poj1013 {
     public static int[] value = new int[20];
     public static String[] a = new String[5];
     public static String[] b = new String[5];
     public static String[] c = new String[5];
     public static final int REAL = 233;

     public static void work(int r, int len, int type) {
         if (type == 1) {
             for (int i = 0; i < len; i++) {
                 if (value[a[r].charAt(i)-'A'+1] != REAL) value[a[r].charAt(i)-'A'+1]++;
                 if (value[b[r].charAt(i)-'A'+1] != REAL) value[b[r].charAt(i)-'A'+1]--;
             }
         }
         else if (type == 2) {
             for (int i = 0; i < len; i++) {
                 if (value[a[r].charAt(i)-'A'+1] != REAL) value[a[r].charAt(i)-'A'+1]--;
                 if (value[b[r].charAt(i)-'A'+1] != REAL) value[b[r].charAt(i)-'A'+1]++;
             }
         }
         else /*if (type == 3)*/ {
             for (int i = 0; i < len; i++) {
                 value[a[r].charAt(i)-'A'+1] = REAL;
                 value[b[r].charAt(i)-'A'+1] = REAL;
             }
         }

     }

     public static void main(String[] args) {
         Scanner cin = new Scanner(System.in);
         for (int n = cin.nextInt(); n-- > 0; ) {
             for (int i = 1; i < 20; i++) value[i] = 0;
             for (int r = 1; r <= 3; r++) {
                 a[r] = cin.next();b[r] = cin.next();c[r] = cin.next();int len = a[r].length();
                 if (c[r].equals("up")) work(r, len, 1);
                 else if (c[r].equals("down")) work(r, len, 2);
                 else /*if (c[r].equals("even"))*/ work(r, len, 3);
             }
             int max = 0,id = 0;
             for (int i = 1; i <= 13; i++) {
                 int val = Math.abs(value[i]);
                 if (value[i] != REAL && val > max) { max = val;id = i; }
             }
             System.out.println((char)(id-1+'A') + " is the counterfeit coin and it is " + (value[id]>0?"heavy":"light") + ".");
         }
     }
 }