Вывод:
рот тор
о о
тот тот
package com.javarush.task.task22.task2207;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;
public class Solution {
public static List<Pair> result = new LinkedList<>();
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
String fileName = reader.readLine();
reader.close();
BufferedReader reader1 = new BufferedReader(new FileReader(fileName));
Set<String> set = new LinkedHashSet<>();
while (reader1.ready()) {
set.addAll(Arrays.asList((reader1.readLine().split(" "))));
}
reader1.close();
for (String element : set) {
String reverseStr = new StringBuilder(element).reverse().toString();
if (set.contains(reverseStr)) {
Pair pairToAdd = new Pair(element, reverseStr);
if (!result.contains(pairToAdd)) {
result.add(pairToAdd);
}
}
}
for (Pair element : result) {
System.out.println(element);
}
}
public static class Pair {
String first;
String second;
public Pair(String first, String second) {
this.first = first;
this.second = second;
}
public Pair() {
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Pair pair = (Pair) o;
Set<String> e1value = new HashSet() {{
add(pair.first);
add(pair.second);
}};
Set<String> e2value = new HashSet() {{
add(first);
add(second);
}};
return e1value.containsAll(e2value);
}
@Override
public int hashCode() {
int result = first != null ? first.hashCode() : 0;
result = 31 * result + (second != null ? second.hashCode() : 0);
return result;
}
@Override
public String toString() {
return first == null && second == null ? "" :
first == null && second != null ? second :
second == null && first != null ? first :
first.compareTo(second) < 0 ? first + " " + second : second + " " + first;
}
}
}