Correct output, but not verifying.
package com.codegym.task.task20.task2027;
import java.util.ArrayList;
import java.util.List;
/*
Word search
*/
public class Solution {
public static void main(String[] args) {
int[][] wordSearch = new int[][]{
//0 1 2 3 4 5 6
{'f', 'd', 'e', 'r', 'l', 'k', 'x'},// 0
{'u', 's', 'a', 'm', 'e', 'o', 'd'},// 1
{'l', 'n', 'g', 'r', 'o', 'v', 'z'},// 2
{'m', 'l', 'p', 'r', 'r', 'h', 'w'},// 3
{'p', 'o', 'e', 'e', 'a', 'a', 'c'},// 4
{'u', 's', 'a', 'm', 'a', 'a', 'd'},// 5
{'l', 'n', 'g', 'r', 'a', 'a', 'z'},// 6
{'m', 'l', 'p', 'r', 'a', 'a', 'w'},// 7
{'p', 'o', 'e', 'q', 's', 'a', 'c'},// 8
{'f', 'd', 'e', 'r', 'a', 'a', 'x'},// 9
};
List<Word> list = detectAllWords(wordSearch, "erv", "epn", "err", "eaa", "emr", "ean", "eeo");
// System.out.println(detectWord(1, wordSearch, 3, 5, 4));
for (Word word : list) {
System.out.println(word);
}
/*
Expected result
home - (5, 3) - (2, 0)
same - (1, 1) - (4, 1)
*/
}
public static List<Word> detectAllWords (int[][] wordSearch, String... words) {
List<Word> wordList = new ArrayList<>();
for (int i = 0; i < wordSearch.length; i++) {
for (int k = 0; k < wordSearch[0].length; k++) {
for (int j = 1; j < 9; j++) {
for (String word : words) {
Word result = detectWord(j, wordSearch, i, k, word.length());
if (result != null && result.getText().equals(word)) {
wordList.add(result);
}
}
}
}
}
return wordList;
}
public static Word detectWord(int cas, int[][] wordSearch, int y, int x, int length) {
StringBuilder sb = new StringBuilder();
Solution.Word result = null;
int startY = y;
int startX = x;
switch (cas) {
case 1:
try {
for (int i = 0; i < length; i++) {
sb.append((char) wordSearch[y][x]);
y--;
x--;
}
result = new Word(sb.toString(), startX, startY, x + 1, y + 1);
break;
}
catch (Exception e) {
break;
}
case 2:
try {
for (int i = 0; i < length; i++) {
sb.append((char) wordSearch[y][x]);
y--;
}
result = new Word(sb.toString(), startX, startY, x, y + 1);
break;
}
catch (Exception e) {
break;
}
case 3:
try {
for (int i = 0; i < length; i++) {
sb.append((char) wordSearch[y][x]);
y--;
x++;
}
result = new Word(sb.toString(), startX, startY, x - 1, y + 1);
break;
}
catch (Exception e) {
break;
}
case 4:
try {
for (int i = 0; i < length; i++) {
sb.append((char) wordSearch[y][x]);
x++;
}
result = new Word(sb.toString(), startX, startY, x - 1, y);
break;
}
catch (Exception e) {
break;
}
case 5:
try {
for (int i = 0; i < length; i++) {
sb.append((char) wordSearch[y][x]);
y++;
x++;
}
result = new Word(sb.toString(), startX, startY, x - 1, y - 1);
break;
}
catch (Exception e) {
break;
}
case 6:
try {
for (int i = 0; i < length; i++) {
sb.append((char) wordSearch[y][x]);
y++;
}
result = new Word(sb.toString(), startX, startY, x, y - 1);
break;
}
catch (Exception e) {
break;
}
case 7:
try {
for (int i = 0; i < length; i++) {
sb.append((char) wordSearch[y][x]);
y++;
x--;
}
result = new Word(sb.toString(), startX, startY, x + 1, y - 1);
break;
}
catch (Exception e) {
break;
}
case 8:
try {
for (int i = 0; i < length; i++) {
sb.append((char) wordSearch[y][x]);
x--;
}
result = new Word(sb.toString(), startX, startY, x + 1, y);
break;
}
catch (Exception e) {
break;
}
}
return result;
}
public static class Word {
private String text;
private int startX;
private int startY;
private int endX;
private int endY;
public Word(String text, int startX, int startY, int endX, int endY) {
this.text = text;
this.startX = startX;
this.startY = startY;
this.endX = endX;
this.endY = endY;
}
public String getText() {
return text;
}
@Override
public String toString() {
return String.format("%s - (%d, %d) - (%d, %d)", text, startX, startY, endX, endY);
}
}
}