Протестировал на множестве вариантов из данного раздела, по-моему ловит все
package com.javarush.task.task20.task2027;
import java.util.ArrayList;
import java.util.List;
/*
Кроссворд
*/
public class Solution {
public static void main(String[] args) {
int[][] crossword = new int[][]{
{'a', 'b', 'c'},
{'b', 'd', 'd'},
{'c', 'd', 'd'}
};
List<Word> wordsList = detectAllWords(crossword, "bb","dd","c");
for (Word word: wordsList) {
System.out.println(word);
}
/*
Ожидаемый результат
home - (5, 3) - (2, 0)
same - (1, 1) - (4, 1)
*/
}
public static List<Word> detectAllWords(int[][] crossword, String... words) {
List<Word> wordsList = new ArrayList<>();
boolean flag = false;
for (String word: words) {
char[] chars = word.toCharArray();
Word wordInCross = null;
for (int i = 0; i < crossword.length ; i++) {
for (int j = 0; j < crossword[i].length; j++) {
if (chars[0] == crossword[i][j]) {
if (chars.length == 1) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j,i);
wordsList.add(wordInCross);
}
else if (i == crossword.length-1 && j == crossword[i].length-1) {
if ((j-1) > -1 && chars[1] == crossword[i][j-1] ) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((j-k) > -1 && chars[k] == crossword[i][j-k]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j-(chars.length-1),i);
wordsList.add(wordInCross);
}
}
if ((i-1) > -1 && chars[1] == crossword[i-1][j]) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((i-k) > -1 && chars[k] == crossword[i-k][j]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j,i-(chars.length-1));
wordsList.add(wordInCross);
}
}
if ((j-1) > -1 && (i-1) > -1 && chars[1] == crossword[i-1][j-1]) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((j-k) > -1 && (i-k) > -1 && chars[k] == crossword[i-k][j-k]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j-(chars.length-1),i-(chars.length-1));
wordsList.add(wordInCross);
}
}
}
else if (j == crossword[i].length-1) {
if ((j-1) > -1 && chars[1] == crossword[i][j-1] ) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((j-k) > -1 && chars[k] == crossword[i][j-k]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j-(chars.length-1),i);
wordsList.add(wordInCross);
}
}
if ((i-1) > -1 && chars[1] == crossword[i-1][j]) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((i-k) > -1 && chars[k] == crossword[i-k][j]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j,i-(chars.length-1));
wordsList.add(wordInCross);
}
}
if ((j-1) > -1 && (i-1) > -1 && chars[1] == crossword[i-1][j-1]) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((j-k) > -1 && (i-k) > -1 && chars[k] == crossword[i-k][j-k]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j-(chars.length-1),i-(chars.length-1));
wordsList.add(wordInCross);
}
}
if ((i+1) < crossword.length && chars[1] == crossword[i+1][j]) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((i+k) < crossword.length && chars[k] == crossword[i+k][j]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j,i+(chars.length-1));
wordsList.add(wordInCross);
}
}
if ((j-1) > -1 && (i+1) < crossword.length && chars[1] == crossword[i+1][j-1]) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((j-k) > -1 && (i+k) < crossword.length && chars[k] == crossword[i+k][j-k]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j-(chars.length-1),i+(chars.length-1));
wordsList.add(wordInCross);
}
}
}
else if (i == crossword.length-1) {
if ((j-1) > -1 && chars[1] == crossword[i][j-1] ) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((j-k) > -1 && chars[k] == crossword[i][j-k]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j-(chars.length-1),i);
wordsList.add(wordInCross);
}
}
if ((i-1) > -1 && chars[1] == crossword[i-1][j]) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((i-k) > -1 && chars[k] == crossword[i-k][j]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j,i-(chars.length-1));
wordsList.add(wordInCross);
}
}
if ((j-1) > -1 && (i-1) > -1 && chars[1] == crossword[i-1][j-1]) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((j-k) > -1 && (i-k) > -1 && chars[k] == crossword[i-k][j-k]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j-(chars.length-1),i-(chars.length-1));
wordsList.add(wordInCross);
}
}
if ((j+1) < crossword[i].length && (i-1) > -1 && chars[1] == crossword[i-1][j+1]) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((j+k) < crossword[i].length && (i-k) > -1 && chars[k] == crossword[i-k][j+k]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j+(chars.length-1),i-(chars.length-1));
wordsList.add(wordInCross);
}
}
if ((j+1) < crossword[i].length && chars[1] == crossword[i][j+1] ) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((j+k) < crossword[i].length && chars[k] == crossword[i][j+k]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j+(chars.length-1),i);
wordsList.add(wordInCross);
}
}
}
else {
if ((j-1) > -1 && chars[1] == crossword[i][j-1] ) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((j-k) > -1 && chars[k] == crossword[i][j-k]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j-(chars.length-1),i);
wordsList.add(wordInCross);
}
}
if ((i-1) > -1 && chars[1] == crossword[i-1][j]) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((i-k) > -1 && chars[k] == crossword[i-k][j]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j,i-(chars.length-1));
wordsList.add(wordInCross);
}
}
if ((j-1) > -1 && (i-1) > -1 && chars[1] == crossword[i-1][j-1]) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((j-k) > -1 && (i-k) > -1 && chars[k] == crossword[i-k][j-k]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j-(chars.length-1),i-(chars.length-1));
wordsList.add(wordInCross);
}
}
if ((i+1) < crossword.length && chars[1] == crossword[i+1][j]) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((i+k) < crossword.length && chars[k] == crossword[i+k][j]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j,i+(chars.length-1));
wordsList.add(wordInCross);
}
}
if ((j-1) > -1 && (i+1) < crossword.length && chars[1] == crossword[i+1][j-1]) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((j-k) > -1 && (i+k) < crossword.length && chars[k] == crossword[i+k][j-k]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j-(chars.length-1),i+(chars.length-1));
wordsList.add(wordInCross);
}
}
if ((j+1) < crossword[i].length && (i-1) > -1 && chars[1] == crossword[i-1][j+1]) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((j+k) < crossword[i].length && (i-k) > -1 && chars[k] == crossword[i-k][j+k]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j+(chars.length-1),i-(chars.length-1));
wordsList.add(wordInCross);
}
}
if ((j+1) < crossword[i].length && chars[1] == crossword[i][j+1] ) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((j+k) < crossword[i].length && chars[k] == crossword[i][j+k]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j+(chars.length-1),i);
wordsList.add(wordInCross);
}
}
if ((j+1) < crossword[i].length && (i+1) < crossword.length && chars[1] == crossword[i+1][j+1]) {
flag = true;
for (int k = 2; k < chars.length ; k++) {
if ((j+k) < crossword[i].length && (i+k) < crossword.length && chars[k] == crossword[i+k][j+k]) {
flag = true;
} else flag = false;
}
if (flag) {
wordInCross = new Word(word);
wordInCross.setStartPoint(j,i);
wordInCross.setEndPoint(j+(chars.length-1),i+(chars.length-1));
wordsList.add(wordInCross);
}
}
}
}
}
}
}
return wordsList;
}
public static class Word {
private String text;
private int startX;
private int startY;
private int endX;
private int endY;
public Word(String text) {
this.text = text;
}
public void setStartPoint(int i, int j) {
startX = i;
startY = j;
}
public void setEndPoint(int i, int j) {
endX = i;
endY = j;
}
@Override
public String toString() {
return String.format("%s - (%d, %d) - (%d, %d)", text, startX, startY, endX, endY);
}
}
}