Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>If I understand the problem correctly, you can pick every adjacent cell for the next letter, right? In that case, the code below would (I think) solve your problem.</p> <p>I changed the constructor of <code>Map</code>, because it is easier to work with a two-dimensional array of <code>char</code>.</p> <p>The function <code>contains</code> does just what your step 3 described: find the first letter and try searching on from there. The function <code>findRecursively</code> searches for the rest of the word recursively.</p> <pre><code>public class Map { private char[][] board; public Map(final char[] pTab1, final char[] pTab2, final char[] pTab3, final char[] pTab4) { board = new char[4][4]; for (int i = 0 ; i &lt; 4 ; i++) { board[0][i] = pTab1(i); board[1][i] = pTab2(i); board[2][i] = pTab3(i); board[3][i] = pTab4(i); } } public boolean contains(String word) { char[] array = word.toCharArray(); // empty string is trivial if (array.length == 0) return true; for(int i = 0; i &lt; 4; i++) { for (int j = 0; j &lt; 4; j++) { if (board[i][j] == array[0] &amp;&amp; findRecursively(i, j, array, 1)) return true; } } return false; } public boolean isValid(int i, int j) { return (0 &lt;= i &amp;&amp; i &lt; 4) &amp;&amp; (0 &lt;= j &amp;&amp; j &lt; 4); } public boolean findRecursively(int i, int j, char[] array, int index) { // reached end of word if (index == array.length) { return true; } else { // loop over all neighbors for (int di = -1; di &lt;= 1; di++) { for (int dj = -1; dj &lt;= 1; dj++) { // skip cell itself and invalid cells if (!(di == 0 &amp;&amp; dj == 0) &amp;&amp; isValid(i+di, j+dj)) { if (board[i+di][j+dj] == array[index] &amp;&amp; findRecursively(i+di, j+dj, array, index+1)) return true; } } } return false; } } } </code></pre>
    singulars
    1. This table or related slice is empty.
    1. POTreating a bidimensional text (Ruzzle solver)
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USVincent van der Weele
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POTreating a bidimensional text (Ruzzle solver)
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    1. COYour implementation looks very nice, I will give it a try tomorrow. Thanks for your help, I'll tell you if it works for me.
      singulars
      1. PO
      1. USSeeven
    2. COJust be careful because this code does not forbid coming back to the same letter multiple times. You have to be sure the game allows this.
      singulars
      1. PO
      1. USAndré Chalella
    3. CO@AndréNeves You're right, I had to find a way to prevent the same cell to be read twice in one same word, using a two-dimensional array of booleans. I finished my program thanks to you two.
      singulars
      1. PO
      1. USSeeven
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload