Poj 2503 Babelfish(Map操作)

一、Description

You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.

Input

Input consists of up to 100,000 dictionary entries, followed by a blank line, followed by a message of up to 100,000 words. Each dictionary entry is a line containing an English word, followed by a space and a foreign language word. No foreign word appears more than once in the dictionary. The message is a sequence of words in the foreign language, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters.

Output

Output is the message translated to English, one word per line. Foreign words not in the dictionary should be translated as "eh".
二、题解
        只要用Map把字典存起来，注意键值对的顺序，这里应该后面的字符串为键，前面的为值。然后再依次查找就可以了。
三、java代码

 import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
        
    public class Main {     
        public static void main(String[] args) throws IOException {     
           BufferedReader bfd=new BufferedReader(new InputStreamReader(System.in));
           HashMap<String,String> hm=new HashMap<String,String>();
           String s;
           String [] seq=new String[2];
           while(!(s=bfd.readLine()).equals("")){
        	   seq=s.split(" ");
        	   hm.put(seq[1], seq[0]);
           }
           while(!(s=bfd.readLine()).equals("")){
        	   if(hm.containsKey(s))
        		   System.out.println(hm.get(s));
        	   else
        		   System.out.println("eh");
        	}
     }  
 }     

版权声明：本文为博主原创文章，未经博主允许不得转载。