На входе:
рот рот рот тор торт о
о тот тот тотрот тор торт о
о тот тот тот
На выходе:
рот тор
о о
тот тот
package com.javarush.task.task22.task2207;
import java.io.*;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
/*
Обращенные слова
*/
public class Solution implements AutoCloseable {
public static List<Pair> result = new LinkedList<>();
public static void main(String[] args) throws IOException {
try (BufferedReader console_read = new BufferedReader(new InputStreamReader(System.in));
// BufferedReader file_input = new BufferedReader(new FileReader("e:\\input.txt")))
BufferedReader file_input = new BufferedReader(new FileReader(console_read.readLine())))
{
String[] word_list;
ArrayList<String> word_array = new ArrayList<>();
while (file_input.ready()) {
word_list = file_input.readLine().split("\\s");
for (String check : word_list) {
word_array.add(check);
}
}
for (String word_revers : word_array) {
StringBuilder check_word = new StringBuilder(word_revers).reverse();
for (String compare : word_array) {
if (new String(check_word).equals(compare)) {
String reversed = new String(check_word);
String orig = new String(check_word.reverse());
if (result.size() == 0) {
result.add(new Pair(orig, reversed));
}
else {
int size = result.size();
for (int i = 0; i < size; i++) {
if (result.get(i).first.equals(orig) || result.get(i).second.equals(orig)) {
break;
}
else if (i == size -1) {
result.add(new Pair(orig, reversed));
}
}
}
}
}
}
for (Pair fin : result) {
System.out.println(fin.first + " " + fin.second);
}
}
}
@Override
public void close() throws Exception {
}
public static class Pair {
String first;
String second;
public Pair() {
}
public Pair(String first, String second) {
this.first = first;
this.second = second;
}
@Override
public boolean equals(Object o) {
if (this == o) return true;
if (o == null || getClass() != o.getClass()) return false;
Pair pair = (Pair) o;
if (first != null ? !first.equals(pair.first) : pair.first != null) return false;
return second != null ? second.equals(pair.second) : pair.second == null;
}
@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;
}
}
}