kennethreitz/dive-into-python3
1
0
Fork 0
mirror of https://github.com/kennethreitz/dive-into-python3.git synced 2026-06-05 23:10:17 +00:00
Code Issues Packages Projects Releases Wiki Activity

typo

Browse Source
This commit is contained in:
Mark Pilgrim
2009-07-25 13:34:53 -04:00
parent b9508d716a
commit 1bde8754ee
1 changed files with 2 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
advanced-iterators.html
+2 -2
View File
@@ -5,7 +5,7 @@
<!--[if IE]><script src=j/html5.js></script><![endif]--> <!--[if IE]><script src=j/html5.js></script><![endif]-->
<link rel=stylesheet href=dip3.css> <link rel=stylesheet href=dip3.css>
<style> <style>
body{counter-reset:h1 7} body{counter-reset:h1 8}
mark{display:inline} mark{display:inline}
</style> </style>
<link rel=stylesheet media='only screen and (max-device-width: 480px)' href=mobile.css> <link rel=stylesheet media='only screen and (max-device-width: 480px)' href=mobile.css>
@@ -50,7 +50,7 @@ import itertools
def solve(puzzle): def solve(puzzle):
words = re.findall('[A-Z]+', puzzle.upper()) words = re.findall('[A-Z]+', puzzle.upper())
unique_characters = set(join(words)) unique_characters = set(''.join(words))
assert len(unique_characters) <= 10, 'Too many letters' assert len(unique_characters) <= 10, 'Too many letters'
first_letters = {word[0] for word in words} first_letters = {word[0] for word in words}
n = len(first_letters) n = len(first_letters)