projects
/
wordplay-cdsw-solutions
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
reworked these examples a bit based on feedback in class
[wordplay-cdsw-solutions]
/
solution_6.py
diff --git
a/solution_6.py
b/solution_6.py
index 62e13f2d0731c38c9840e6d8fea1fea0e2e62e8d..93747c9a119db25214c816cb93b716170008993e 100644
(file)
--- a/
solution_6.py
+++ b/
solution_6.py
@@
-8,23
+8,27
@@
import scrabble
new_words = []
for word in scrabble.wordlist:
new_words = []
for word in scrabble.wordlist:
- local_chars = {}
-
seen_before
= False
+ unique_letters = []
+
duplicated_letters
= False
for character in word:
# have we seen this character before?
for character in word:
# have we seen this character before?
- if character in
local_cha
rs:
-
seen_before
= True
- break # Exit the loop early, since we've found a collision.
- # store the character
- local_chars[character] = 1
+ if character in
unique_lette
rs:
+
duplicated_letters
= True
+ else:
+
# store the character
+ unique_letters.append(character)
- if not
seen_before
:
+ if not
duplicated_letters
:
new_words.append(word)
# Reuse my code for longest word
new_words.append(word)
# Reuse my code for longest word
-longest_so_far = ''
+longest_so_far = []
+longest_length = 0
for word in new_words:
for word in new_words:
- if len(word) > len(longest_so_far):
- longest_so_far = word
+ if len(word) > longest_length:
+ longest_so_far = [word]
+ longest_length = len(word)
+ elif len(word) == longest_length:
+ longest_so_far.append(word)
-print
longest_so_far
+print
(longest_so_far)
Benjamin Mako Hill
||
Want to submit a patch?