Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
72 changes: 72 additions & 0 deletions assignment3.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,72 @@
class Dictionary(object):
def __init__(self, dictionary=None):
self.dictionary = []

def insert_words(self, word_list):
self.dictionary = word_list

def is_word(self, string):
return (string in self.dictionary)

def is_prefix(self, string):
for word in self.dictionary:
if len(word) >= len(string) and word[0:len(string)] == string:
return True
return False


result_set = []
def solution(n_rows, n_columns, matrix, dict_object):
word_sofar = ''
for i in range(n_rows):
for j in range(n_columns):
visited = []
find_word_for_cell(n_rows, n_columns, matrix, dict_object, i, j, word_sofar, visited)

print(result_set)


def find_word_for_cell(n_rows, n_columns, matrix, dict, row_number, col_number, word_sofar, visited ):\

word_sofar = word_sofar + matrix[row_number][col_number]

if(dict.is_word(word_sofar)):
# print(word_sofar)
result_set.append(word_sofar)

if(not dict.is_prefix(word_sofar)):
return

visited.append([row_number,col_number])

# left up
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

While this block of ifs is correct, can you maybe think of a more maintainable way to implement it? (Generalize all the 8 cases)

if(row_number-1 >= 0 and col_number -1 >=0 and [row_number-1,col_number-1] not in visited):
find_word_for_cell(n_rows, n_columns, matrix, dict, row_number-1, col_number-1, word_sofar, visited)
# middle up
if(row_number-1 >= 0 and [row_number-1,col_number] not in visited):
find_word_for_cell(n_rows, n_columns, matrix, dict, row_number-1, col_number, word_sofar, visited)
# right up
if(row_number-1 >= 0 and col_number +1 < n_columns and [row_number-1,col_number+1] not in visited):
find_word_for_cell(n_rows, n_columns, matrix, dict, row_number-1, col_number+1, word_sofar, visited)
# left middle
if( col_number -1 >=0 and [row_number,col_number-1] not in visited):
find_word_for_cell(n_rows, n_columns, matrix, dict, row_number, col_number-1, word_sofar, visited)
# right middle
if(col_number +1 < n_columns and [row_number,col_number+1] not in visited):
find_word_for_cell(n_rows, n_columns, matrix, dict, row_number, col_number+1, word_sofar, visited)
# left down
if(row_number+1 < n_rows and col_number -1 >=0 and [row_number+1,col_number-1] not in visited):
find_word_for_cell(n_rows, n_columns, matrix, dict, row_number+1, col_number-1, word_sofar, visited)
# middle down
if(row_number+1 < n_rows and [row_number+1,col_number] not in visited):
find_word_for_cell(n_rows, n_columns, matrix, dict, row_number+1, col_number, word_sofar, visited)
# right down
if(row_number+1 < n_rows and col_number +1 < n_columns and [row_number+1,col_number+1] not in visited):
find_word_for_cell(n_rows, n_columns, matrix, dict, row_number+1, col_number+1, word_sofar, visited)


dictionary = Dictionary()
dictionary.insert_words(['CAR', 'CARD', 'CART', 'CAT'])
matrix = [['A', 'A', 'R'],['T', 'C', 'D']]

solution(2, 3, matrix, dictionary)