Перебор, валидатор не пропускает последний пункт. Помогите найти дыры слова, которые не видит программа.
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[][]{
{'f', 'd', 'e', 'r', 'l', 'k'},
{'u', 's', 'a', 'm', 'e', 'o'},
{'l', 'n', 'g', 'r', 'o', 'v'},
{'m', 'l', 'p', 'r', 'r', 'h'},
{'p', 'o', 'e', 'e', 'j', 'j'}
};
detectAllWords(crossword, "home", "same");
/*
Ожидаемый результат
home - (5, 3) - (2, 0)
same - (1, 1) - (4, 1)
*/
}
public static List<Word> detectAllWords(int[][] crossword, String... words) {
List<Word> list = new ArrayList<>();
for (String el : words) {
char[] mas = el.toCharArray();
for (int a = 0; a < crossword.length; a++) {
for (int b = 0; b < crossword[a].length; b++) {
if (crossword[a][b]==mas[0]) {
List<Word> start = enumeration(a, b, el, crossword);
for (Word word : start) list.add(word);
}
}
}
}
System.out.println(list.toString());
return list;
}
public static List<Word> enumeration(int a, int b, String el, int[][] crossword) {
List<Word> list = new ArrayList<>();
if (el.length() == 1) {
Word word = new Word(el);
word.setStartPoint(b, a);
word.setEndPoint(b, a);
list.add(word);
return list;
}
String s = "";
int len = 0;
int nA = a;
int nB = b;
while (nA < crossword.length && len < el.length()) {
s+=(char)crossword[nA][nB];
nA++;
len++;
}
nA--;
if (s.equals(el)) {
Word word = new Word(el);
word.setStartPoint(b, a);
word.setEndPoint(nB, nA);
list.add(word);
}
else {
s = "";
len = 0;
nA = a;
nB = b;
while (nA!=-1 && len < el.length()) {
s+=(char)crossword[nA][nB];
nA--;
len++;
}
nA++;
if (s.equals(el)) {
Word word = new Word(el);
word.setStartPoint(b, a);
word.setEndPoint(nB, nA);
list.add(word);
}
}
s = "";
len = 0;
nA = a;
nB = b;
while (nB < crossword[nA].length && len < el.length()) {
s+=(char)crossword[nA][nB];
nB++;
len++;
}
nB--;
if (s.equals(el)) {
Word word = new Word(el);
word.setStartPoint(b, a);
word.setEndPoint(nB, nA);
list.add(word);
}
else {
s = "";
len = 0;
nA = a;
nB = b;
while (nB!=-1 && len < el.length()) {
s+=(char)crossword[nA][nB];
nB--;
len++;
}
nB++;
if (s.equals(el)) {
Word word = new Word(el);
word.setStartPoint(b, a);
word.setEndPoint(nB, nA);
list.add(word);
}
}
s = "";
len = 0;
nA = a;
nB = b;
while (nA < crossword.length && nB<crossword.length && len < el.length()) {
s+=(char)crossword[nA][nB];
nA++;
nB++;
len++;
}
nA--;
nB--;
if (s.equals(el)) {
Word word = new Word(el);
word.setStartPoint(b, a);
word.setEndPoint(nB, nA);
list.add(word);
}
else {
s = "";
len = 0;
nA = a;
nB = b;
while (nA!=-1 && nB!=-1 && len < el.length()) {
s+=(char)crossword[nA][nB];
nA--;
nB--;
len++;
}
nA++;
nB++;
if (s.equals(el)) {
Word word = new Word(el);
word.setStartPoint(b, a);
word.setEndPoint(nB, nA);
list.add(word);
}
}
s = "";
len = 0;
nA = a;
nB = b;
while (nA!=-1 && nB<crossword.length && len < el.length()) {
s+=(char)crossword[nA][nB];
nA--;
nB++;
len++;
}
nA++;
nB--;
if (s.equals(el)) {
Word word = new Word(el);
word.setStartPoint(b, a);
word.setEndPoint(nB, nA);
list.add(word);
}
else {
s = "";
len = 0;
nA = a;
nB = b;
while (nA<crossword.length && nB!=-1 && len < el.length()) {
s+=(char)crossword[nA][nB];
nA++;
nB--;
len++;
}
nA--;
nB++;
if (s.equals(el)) {
Word word = new Word(el);
word.setStartPoint(b, a);
word.setEndPoint(nB, nA);
list.add(word);
}
}
s = "";
len = 0;
nA = a;
nB = b;
return list;
}
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);
}
}
}