Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //package Kolokvium2;
- import java.io.BufferedReader;
- import java.io.IOException;
- import java.io.InputStreamReader;
- import java.util.Arrays;
- import java.util.stream.Collectors;
- class MapEntry<K extends Comparable<K>,E> implements Comparable<K> {
- // Each MapEntry object is a pair consisting of a key (a Comparable
- // object) and a value (an arbitrary object).
- K key;
- E value;
- public MapEntry (K key, E val) {
- this.key = key;
- this.value = val;
- }
- public int compareTo (K that) {
- // Compare this map entry to that map entry.
- @SuppressWarnings("unchecked")
- MapEntry<K,E> other = (MapEntry<K,E>) that;
- return this.key.compareTo(other.key);
- }
- public String toString () {
- return "<" + key + "," + value + ">";
- }
- }
- class SLLNode<E> {
- protected E element;
- protected SLLNode<E> succ;
- public SLLNode(E elem, SLLNode<E> succ) {
- this.element = elem;
- this.succ = succ;
- }
- @Override
- public String toString() {
- return element.toString();
- }
- }
- class CBHT<K extends Comparable<K>, E> {
- // An object of class CBHT is a closed-bucket hash table, containing
- // entries of class MapEntry.
- private SLLNode<MapEntry<K,E>>[] buckets;
- @SuppressWarnings("unchecked")
- public CBHT(int m) {
- // Construct an empty CBHT with m buckets.
- buckets = (SLLNode<MapEntry<K,E>>[]) new SLLNode[m];
- }
- private int hash(K key) {
- // Napishete ja vie HASH FUNKCIJATA
- return Math.abs(key.hashCode()) % buckets.length;
- }
- public SLLNode<MapEntry<K,E>> search(K targetKey) {
- // Find which if any node of this CBHT contains an entry whose key is
- // equal
- // to targetKey. Return a link to that node (or null if there is none).
- int b = hash(targetKey);
- for (SLLNode<MapEntry<K,E>> curr = buckets[b]; curr != null; curr = curr.succ) {
- if (targetKey.equals(((MapEntry<K, E>) curr.element).key))
- return curr;
- }
- return null;
- }
- public void insert(K key, E val) { // Insert the entry <key, val> into this CBHT.
- MapEntry<K, E> newEntry = new MapEntry<K, E>(key, val);
- int b = hash(key);
- for (SLLNode<MapEntry<K,E>> curr = buckets[b]; curr != null; curr = curr.succ) {
- if (key.equals(((MapEntry<K, E>) curr.element).key)) {
- // Make newEntry replace the existing entry ...
- curr.element = newEntry;
- return;
- }
- }
- // Insert newEntry at the front of the 1WLL in bucket b ...
- buckets[b] = new SLLNode<MapEntry<K,E>>(newEntry, buckets[b]);
- }
- public void delete(K key) {
- // Delete the entry (if any) whose key is equal to key from this CBHT.
- int b = hash(key);
- for (SLLNode<MapEntry<K,E>> pred = null, curr = buckets[b]; curr != null; pred = curr, curr = curr.succ) {
- if (key.equals(((MapEntry<K,E>) curr.element).key)) {
- if (pred == null)
- buckets[b] = curr.succ;
- else
- pred.succ = curr.succ;
- return;
- }
- }
- }
- public String toString() {
- String temp = "";
- for (int i = 0; i < buckets.length; i++) {
- temp += i + ":";
- for (SLLNode<MapEntry<K,E>> curr = buckets[i]; curr != null; curr = curr.succ) {
- temp += curr.element.toString() + " ";
- }
- temp += "\n";
- }
- return temp;
- }
- }
- public class KumanovskiDijalekt {
- public static void main (String[] args) throws IOException {
- BufferedReader br = new BufferedReader(new InputStreamReader(
- System.in));
- int N = Integer.parseInt(br.readLine());
- String[] rechnik = new String[N];
- for (int i = 0; i < N; i++) {
- rechnik[i] = br.readLine();
- }
- String tekst = br.readLine();
- StringBuilder result = new StringBuilder();
- if (N != 0) {
- CBHT<String, String> dictionary = new CBHT<>(2 * rechnik.length);
- for (String s : rechnik) {
- String[] temp = s.split("\\s+");
- dictionary.insert(temp[0], temp[1]);
- }
- String[] words = tekst.split("\\s+");
- for (String word : words) {
- Character lastChar = word.charAt(word.length() - 1);
- word = word.replaceAll("\\.", "")
- .replaceAll(",", "")
- .replaceAll("!", "")
- .replaceAll("\\?", "");
- SLLNode<MapEntry<String, String>> temp = dictionary.search(word.toLowerCase());
- if (temp != null) {
- String translated = temp.element.value;
- if (Character.isUpperCase(word.charAt(0))) {
- translated = temp.element.value
- .replace(temp.element.value.charAt(0),
- Character.toUpperCase(temp.element.value.charAt(0)));
- }
- result.append(translated);
- if(!Character.isLetter(lastChar)) result.append(lastChar).append(" ");
- else result.append(" ");
- }else {
- result.append(word);
- if(!Character.isLetter(lastChar)) result.append(lastChar).append(" ");
- else result.append(" ");
- }
- }
- } else result.append(tekst);
- System.out.println(result);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement