ACM POJ 2503 (Babelfish)

最新推荐文章于 2018-12-21 00:40:20 发布

CathayPoplar

最新推荐文章于 2018-12-21 00:40:20 发布

阅读量872

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM 字典树字符串文章标签： ACM POJ 2503 JAVA

本文链接：https://blog.youkuaiyun.com/cathaypoplar/article/details/18520967

ACM 同时被 3 个专栏收录

49 篇文章

订阅专栏

字符串

12 篇文章

订阅专栏

字典树

5 篇文章

订阅专栏

本文提供了解决 POJ 2503 问题的两种方法：一种使用字典树（Trie），另一种采用 HashMap。字典树方案通过逐字符插入和查找来实现英语单词与外语单词之间的映射；而 HashMap 方案则直接利用键值对存储映射关系。两种方法均可高效完成题目要求。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目链接 http://poj.org/problem?id=2503

程序一字典树

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner scn = new Scanner(System.in);
		Trie trie = new Trie();
		while (scn.hasNext()) {
			String string = scn.nextLine();
			if (0 == string.length()) {
				break;
			}
			String[] language = string.split(" ", -1);
			trie.insert(language[0], language[1]);
		}
		while (scn.hasNext()) {
			System.out.println(trie.search(scn.nextLine()));
		}
		scn.close();
	}

}

class Trie {

	private Node root;

	public Trie() {
		root = new Node(new Node[26], null);
	}

	public void insert(String english, String foreign) {
		Node current = root;
		for (int i = 0; i < foreign.length(); ++i) {
			if (null != current.getChildrenItem(foreign.charAt(i) - 'a')) {
				current = current.getChildrenItem(foreign.charAt(i) - 'a');
			} else {
				Node newNode = new Node(new Node[26], null);
				current.setChildrenItem(foreign.charAt(i) - 'a', newNode);
				current = newNode;
			}
		}
		current.setEnglish(english);
	}

	public String search(String foreign) {
		Node current = root;
		for (int i = 0; i < foreign.length(); ++i) {
			if (null != current.getChildrenItem(foreign.charAt(i) - 'a')) {
				current = current.getChildrenItem(foreign.charAt(i) - 'a');
			} else {
				return "eh";
			}
		}
		return current.getEnglish();
	}

}

class Node {

	private Node[] children;
	private String english;

	public Node(Node[] children, String english) {
		this.children = children;
		this.english = english;
	}

	public Node getChildrenItem(int i) {
		return children[i];
	}

	public void setChildrenItem(int i, Node node) {
		children[i] = node;
	}

	public String getEnglish() {
		return english;
	}

	public void setEnglish(String english) {
		this.english = english;
	}

}

程序二 HashMap类

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

public class Main {

	public static void main(String[] args) {
		Scanner scn = new Scanner(System.in);
		Map<String, String> map = new HashMap<String, String>();
		while (scn.hasNext()) {
			String string = scn.nextLine();
			if (0 == string.length()) {
				break;
			}
			String[] language = string.split(" ", -1);
			map.put(language[1], language[0]);
		}
		while (scn.hasNext()) {
			String foreign = scn.nextLine();
			if (map.containsKey(foreign)) {
				System.out.println(map.get(foreign));
			} else {
				System.out.println("eh");
			}
		}
		scn.close();
	}

}