Merge pull request #1 from ben-zen/master

[wordplay-cdsw-solutions] / solution_2_advanced.py

diff --git a/solution_2_advanced.py b/solution_2_advanced.py
index dc157a3095a1ec0a699d04d5a2505d8efd9bae9c..e4f056d844100e90eda53826ce4c80fd488f5f56 100644 (file)
--- a/solution_2_advanced.py
+++ b/solution_2_advanced.py
@@ -1,6 +1,5 @@
 import scrabble
 
-
 # What is the longest word that starts with a q?
 
 # This problem was ill-specified. What if there isn't a single longest word? What if
@@ -8,7 +7,6 @@ import scrabble
 # We designed this problem with that ambiguity in mind, because sometimes the thing
 # we want to measure may not exist, or may not exist in the way we anticipate.
 
-
 # This solution keeps EVERY word of the longest length.
 
 longest_so_far = [] 
@@ -17,15 +15,11 @@ length_of_longest_word = 0
 for word in scrabble.wordlist:
 
     if word[0] == 'q':
-       if len(word) > length_of_longest_word:
-           length_of_longest_word = len(word)
-           longest_so_far = [word]
-       elif len(word) == length_of_longest_word:
-           longest_so_far.append(word)
+        if len(word) > length_of_longest_word:
+            length_of_longest_word = len(word)
+            longest_so_far = [word]
+        elif len(word) == length_of_longest_word:
+            longest_so_far.append(word)
             #print longest_so_far  # Use this to see the progression.
 
-
 print longest_so_far
-            
-
-