codeforces 解题报告 987A. Infinity Gauntlet

http://codeforces.com/problemset/problem/987/A

解题思路：

1.六个字符串对应六个字符串，用map存储。输入一个字符串，就把这个字符串对应的map删掉

2.遍历剩余的key，输出对应的value

import java.util.HashMap;
import java.util.Iterator;
import java.util.Map;
import java.util.Scanner;

public class Main {

    public static void main(String args[]) {

        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        sc.nextLine();
        Map<String,String> Gem = new HashMap<>();
        Gem.put("purple","Power");
        Gem.put("green","Time");
        Gem.put("blue","Space");
        Gem.put("orange","Soul");
        Gem.put("red","Reality");
        Gem.put("yellow","Mind");
        String[] str = new String[8];
        for(int i = 1;i <= n;i++) {
            str[i] = sc.nextLine();
            Gem.remove(str[i]);
        }

        System.out.println(6 - n);
        Iterator<String> iter = Gem.keySet().iterator();
        while (iter.hasNext()) {
            System.out.println(Gem.get(iter.next()));
        }
    }
}