forked from davecom/ClassicComputerScienceProblemsInJava
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathWordGrid.java
More file actions
166 lines (148 loc) · 4.39 KB
/
WordGrid.java
File metadata and controls
166 lines (148 loc) · 4.39 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
// WordGrid.java
// From Classic Computer Science Problems in Java Chapter 3
// Copyright 2020 David Kopec
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package chapter3;
import java.util.ArrayList;
import java.util.List;
import java.util.Random;
public class WordGrid {
public static class GridLocation {
public final int row, column;
public GridLocation(int row, int column) {
this.row = row;
this.column = column;
}
// auto-generated by Eclipse
@Override
public int hashCode() {
final int prime = 31;
int result = 1;
result = prime * result + column;
result = prime * result + row;
return result;
}
// auto-generated by Eclipse
@Override
public boolean equals(Object obj) {
if (this == obj) {
return true;
}
if (obj == null) {
return false;
}
if (getClass() != obj.getClass()) {
return false;
}
GridLocation other = (GridLocation) obj;
if (column != other.column) {
return false;
}
if (row != other.row) {
return false;
}
return true;
}
}
private final char ALPHABET_LENGTH = 26;
private final char FIRST_LETTER = 'A';
private final int rows, columns;
private char[][] grid;
public WordGrid(int rows, int columns) {
this.rows = rows;
this.columns = columns;
grid = new char[rows][columns];
// initialize grid with random letters
Random random = new Random();
for (int row = 0; row < rows; row++) {
for (int column = 0; column < columns; column++) {
char randomLetter = (char) (random.nextInt(ALPHABET_LENGTH) + FIRST_LETTER);
grid[row][column] = randomLetter;
}
}
}
public void mark(String word, List<GridLocation> locations) {
for (int i = 0; i < word.length(); i++) {
GridLocation location = locations.get(i);
grid[location.row][location.column] = word.charAt(i);
}
}
// get a pretty printed version of the grid
@Override
public String toString() {
StringBuilder sb = new StringBuilder();
for (char[] rowArray : grid) {
sb.append(rowArray);
sb.append(System.lineSeparator());
}
return sb.toString();
}
public List<List<GridLocation>> generateDomain(String word) {
List<List<GridLocation>> domain = new ArrayList<>();
int length = word.length();
for (int row = 0; row < rows; row++) {
for (int column = 0; column < columns; column++) {
if (column + length <= columns) {
// left to right
fillRight(domain, row, column, length);
// diagonal towards bottom right
if (row + length <= rows) {
fillDiagonalRight(domain, row, column, length);
}
}
if (row + length <= rows) {
// top to bottom
fillDown(domain, row, column, length);
// diagonal towards bottom left
if (column - length >= 0) {
fillDiagonalLeft(domain, row, column, length);
}
}
}
}
return domain;
}
private void fillRight(List<List<GridLocation>> domain, int row, int column, int length) {
List<GridLocation> locations = new ArrayList<>();
for (int c = column; c < (column + length); c++) {
locations.add(new GridLocation(row, c));
}
domain.add(locations);
}
private void fillDiagonalRight(List<List<GridLocation>> domain, int row, int column, int length) {
List<GridLocation> locations = new ArrayList<>();
int r = row;
for (int c = column; c < (column + length); c++) {
locations.add(new GridLocation(r, c));
r++;
}
domain.add(locations);
}
private void fillDown(List<List<GridLocation>> domain, int row, int column, int length) {
List<GridLocation> locations = new ArrayList<>();
for (int r = row; r < (row + length); r++) {
locations.add(new GridLocation(r, column));
}
domain.add(locations);
}
private void fillDiagonalLeft(List<List<GridLocation>> domain, int row, int column, int length) {
List<GridLocation> locations = new ArrayList<>();
int c = column;
for (int r = row; r < (row + length); r++) {
locations.add(new GridLocation(r, c));
c--;
}
domain.add(locations);
}
}