I saw that Lisa had the same problem in August, but i could not resolve my program through reading her clues...Thanks in advance
package de.codegym.task.task20.task2027;
import java.util.LinkedList;
import java.util.List;
/*
Wortsuche
*/
public class Solution {
public static void main(String[] args) {
int[][] wordSearch = 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'}
};
List list = detectAllWords(wordSearch, "home", "same");
System.out.println(list);
if(searchWordHV("same",1,1,wordSearch))System.out.println("true");
/*
Erwartetes Ergebnis
home - (5, 3) - (2, 0)
same - (1, 1) - (4, 1)
*/
}
public static List<Word> detectAllWords(int[][] wordSearch, String... words) {
List<Word> list = new LinkedList<>();
for(String s : words){
int size = s.length();
int hoehe = wordSearch.length;
int breite = wordSearch[0].length;
int startX = 0;
int startY = 0;
while(startX<=hoehe){
while(startY<=breite){
if(searchWordDV(s,startX,startY,wordSearch)){
Word w = new Word(s);
w.setStartPoint(startY,startX);
w.setEndPoint(startY+size-1,startX+size-1);
list.add(w);
}
if(searchWordDR(s,startX,startY,wordSearch)){
Word w = new Word(s);
w.setEndPoint(startY,startX);
w.setStartPoint(startY+size-1,startX+size-1);
list.add(w);
}
if(searchWordVV(s,startX,startY,wordSearch)){
Word w = new Word(s);
w.setStartPoint(startY,startX);
w.setEndPoint(startY,startX+size-1);
list.add(w);
}
if(searchWordVR(s,startX,startY,wordSearch)){
Word w = new Word(s);
w.setEndPoint(startY,startX);
w.setStartPoint(startY,startX+size-1);
list.add(w);
}
if(searchWordHV(s,startX,startY,wordSearch)){
Word w = new Word(s);
w.setStartPoint(startY,startX);
w.setEndPoint(startY+size-1,startX);
list.add(w);
}
if(searchWordHR(s,startX,startY,wordSearch)){
Word w = new Word(s);
w.setEndPoint(startY,startX);
w.setStartPoint(startY+size-1,startX);
list.add(w);
}
startY++;
}startX++;startY=0;
}
}
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);
}
}
public static boolean searchLetter(char c,int X, int Y,int[][] feld){
try{boolean b = false;
if(feld[X][Y]==(int)c)b=true;
return b;}
catch(ArrayIndexOutOfBoundsException e){return false;}
}
//nur horizontal normal
public static boolean searchWordHV(String word,int X,int Y,int[][] feld){
boolean b = true;
char[] array = word.toCharArray();
int t = 0;
for(char c :array){
if(!(searchLetter(c,X,Y+t,feld)))b = false;
t++;
}
return b;
}
public static boolean searchWordVV(String word,int X,int Y,int[][] feld){
boolean b = true;
char[] array = word.toCharArray();
int t = 0;
for(char c :array){
if(!(searchLetter(c,X+t,Y,feld)))b = false;
t++;
}
return b;
}
public static boolean searchWordDV(String word,int X,int Y,int[][] feld){
boolean b = true;
char[] array = word.toCharArray();
int t = 0;
for(char c :array){
if(!(searchLetter(c,X+t,Y+t,feld)))b = false;
t++;
}
return b;
}
public static boolean searchWordDR(String word,int X,int Y,int[][] feld){
String newword = turnOver(word);
return searchWordDV(newword,X,Y,feld);
}
public static boolean searchWordHR(String word,int X,int Y,int[][] feld){
String newword = turnOver(word);
return searchWordHV(newword,X,Y,feld);
}
public static boolean searchWordVR(String word,int X,int Y,int[][] feld){
String newword = turnOver(word);
return searchWordVV(newword,X,Y,feld);
}
public static String turnOver(String s){
String erg = "";
char[] array = s.toCharArray();
for(char c :array){
erg = c+erg;
}
return erg;
}
}