Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
35 lines (21 loc) · 704 Bytes

File metadata and controls

35 lines (21 loc) · 704 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
"""This module contains a code example related to
Think Python, 2nd Edition
by Allen Downey
http://thinkpython2.com
Copyright 2015 Allen Downey
License: http://creativecommons.org/licenses/by/4.0/
"""
from __future__ import print_function, division
from inlist import in_bisect, make_word_list
def reverse_pair(word_list, word):
"""Checks whether a reversed word appears in word_list.
word_list: list of strings
word: string
"""
rev_word = word[::-1]
return in_bisect(word_list, rev_word)
if __name__ == '__main__':
word_list = make_word_list()
for word in word_list:
if reverse_pair(word_list, word):
print(word, word[::-1])
Morty Proxy This is a proxified and sanitized view of the page, visit original site.