In [6]:
fruit = "pinapple"
letter = fruit[1]
The second statement selects character number 1 from fruit
and assigns it to letter
.
The expression in brackets is called an index. The index indicates which character in the sequence you want (hence the name).
In [7]:
print(letter)
For most people, the first letter of 'pinapple'
is p, not i. But for computer scientists, the index is an offset from the beginning of the string, and the offset of the first letter is zero.
In [8]:
letter = fruit[0]
print(letter)
So b is the 0th letter (“zero-eth”) of 'pinapple'
, a is the 1th letter (“one-eth”), and n is the 2th d(“two-eth”) letter.
You can use any expression, including variables and operators, as an index, but the value of the index has to be an integer. Otherwise you get:
In [9]:
letter = fruit[1.5]
In [1]:
fruit = 'banana'
len(fruit)
Out[1]:
If you try to get the last letter in variable fruit
, you should use n-1
for last item as in indexing, otherwise you will get an index out of range
error.
In [3]:
length = len(fruit)
fruit[length]
In [4]:
fruit[length-1]
Out[4]:
Alternatively, you can use negative indices, which count backward from the end of the string. The expression fruit[-1]
yields the last letter, fruit[-2]
yields the second to last, and so on.
for
loopWe usually process string one character at a time to make most out of the computations. Going from the first character to the last one is called traversal. We can write a traversal using while loop but it's not really efficient in terms of time spend on writing the code:
In [6]:
fruit = 'pinapple'
index = 0
while index < len(fruit):
letter = fruit[index]
print(letter)
index = index + 1
This loop traverses the string and displays each letter on a line by itself. The loop condition is index < len(fruit)
, so when index
is equal to the length of the string, the condition is false, and the body of the loop is not executed. The last character accessed is the one with the index len(fruit)-1
, which is the last character in the string.
Exercise: Write a function that takes a string as an argument and displays the letters backward, one per line.
In [ ]:
Another and more pythonic way of writing traversal is with for loops:
In [7]:
for char in fruit:
print(char)
Each time through the loop, the next character in the string is assigned to the variable char
. The loop continues until no characters are left.
The following example shows how to use concatenation (string addition) and a for loop to generate an abecedarian series (that is, in alphabetical order). In Robert McCloskey’s book MakeWay for Ducklings, the names of the ducklings are Jack, Kack, Lack, Mack, Nack, Ouack, Pack, and Quack. This loop outputs these names in order:
In [8]:
prefixes = 'JKLMNOPQ'
suffix = 'ack'
for letter in prefixes:
print(letter + suffix)
In [ ]:
In [10]:
s = 'Monty Python'
print(s[0:5])
print(s[6:12])
The operator [n:m]
returns the part of the string from the “n-eth” character to the “m-eth” character, including the first but excluding the last. This behavior is counterintuitive, but it might help to imagine the indices pointing between the characters.
If you omit the first index (before the colon), the slice starts at the beginning of the string. If you omit the second index, the slice goes to the end of the string:
In [11]:
fruit = 'banana'
fruit[:3]
Out[11]:
In [12]:
fruit[3:]
Out[12]:
If the first index is greater than or equal to the second the result is an empty string, represented by two quotation marks:
In [13]:
fruit = 'banana'
fruit[3:3]
Out[13]:
In [ ]:
In [1]:
greeting = 'Hello, world!'
greeting[0] = 'J'
The “object” in this case is the string and the “item” is the character you tried to assign. For now, an object is the same thing as a value, but we will refine that definition later. An item is one of the values in a sequence.
The reason for the error is that strings are immutable, which means you can’t change an existing string. The best you can do is create a new string that is a variation on the original. This example concatenates a new first letter onto a slice of greeting. It has no effect on the original string:
In [2]:
greeting = 'Hello, world!'
new_greeting = 'J' + greeting[1:]
print(new_greeting)
What does the following function do?
def find(word, letter):
index = 0
while index < len(word):
if word[index] == letter:
return index
index = index + 1
return -1
In a sense, find
is the opposite of the []
operator. Instead of taking an index and extracting the corresponding character, it takes a character and finds the index where that character appears. If the character is not found, the function returns -1
.
This is the first example we have seen of a return
statement inside a loop. If word[index] == letter
, the function breaks out of the loop and returns immediately.
If the character doesn’t appear in the string, the program exits the loop normally and returns -1
.
This pattern of computation—traversing a sequence and returning when we find what we are looking for—is called a search
.
Exercise: Modify find
so that it has a third parameter, the index in word
where it should start looking.
In [ ]:
The following program counts the number of times the letter a appears in a string:
word = 'banana'
count = 0
for letter in word:
if letter == 'a':
count = count + 1
print(count)
This program demonstrates another pattern of computation called a counter. The variable count
is initialized to 0 and then incremented each time an a is found. When the loop exits, count
contains the result—the total number of a’s.
Exercise1: Encapsulate this code in a function named count
, and generalize it so that it accepts the string and the letter as arguments.
In [ ]:
Exercise2: Rewrite this function so that instead of traversing the string, it uses the three-parameter version of find
from the previous section.
In [ ]:
In [6]:
word = 'banana'
word.upper()
Out[6]:
This form of dot notation specifies the name of the method, upper
, and the name of the string to apply the method to, word
. The empty parentheses indicate that this method takes no argument.
A method call is called an invocation; in this case, we would say that we are invoking upper
on the word
.
As it turns out, there is a string method named find
that is remarkably similar to the function we wrote:
In [7]:
word = 'banana'
word.find('a')
Out[7]:
In this example, we invoke find
on word
and pass the letter we are looking for as a parameter. Actually, the find
method is more general than our function; it can find substrings, not just characters:
In [8]:
word.find('na')
Out[8]:
It can take as a second argument the index where it should start:
In [9]:
word.find('na', 3)
Out[9]:
And as a third argument the index where it should stop:
In [10]:
name = 'bob'
name.find('b', 1, 2)
Out[10]:
This search fails because b does not appear in the index range from 1 to 2 (not including 2).
Exercise1: There is a string method called count
that is similar to the function in the previous exercise. Read the documentation of this method and write an invocation that counts the number of as in 'banana'
.
In [ ]:
In [11]:
'a' in 'Banana'
Out[11]:
In [12]:
'seed' in 'banana'
Out[12]:
For example, the following function prints all the letters from word1
that also appear in word2
:
def in_both(word1, word2):
for letter in word1:
if letter in word2:
print(letter)
With well-chosen variable names, Python sometimes reads like English. You could read this loop, “for (each) letter in (the first) word, if (the) letter (appears) in (the second) word, print (the) letter.”
Here’s what you get if you compare apples and oranges:
In [13]:
def in_both(word1, word2):
for letter in word1:
if letter in word2:
print(letter)
In [14]:
in_both("apples", "oranges")
In [15]:
if word == 'banana':
print('All right, bananas.')
Other relational operations are useful for putting words in alphabetical order:
In [17]:
if word < 'banana':
print('Your word,' + word + ', comes before banana.')
elif word > 'banana':
print('Your word,' + word + ', comes after banana.')
else:
print('All right, bananas.')
Python does not handle uppercase and lowercase letters the same way that people do. All the uppercase letters come before all the lowercase letters, so:
Your word, Pineapple, comes before banana.
A common way to address this problem is to convert strings to a standard format, such as all lowercase, before performing the comparison. Keep that in mind in case you have to defend yourself against a man armed with a Pineapple.
Exercise1: string slice can take a third index that specifies the “step size;” that is, the number of spaces between successive characters. A step size of 2 means every other character; 3 means every third, etc.
fruit = 'banana'
fruit[0:5:2]
'bnn'
A step size of -1 goes through the word backwards, so the slice [::-1]
generates a reversed string.
In [ ]:
Exercise2: The following functions are all intended to check whether a string contains any lowercase letters, but at least some of them are wrong. For each function, describe what the function actually does (assuming that the parameter is a string).
def any_lowercase1(s):
for c in s:
if c.islower():
return True
else:
return False
def any_lowercase2(s):
for c in s:
if 'c'.islower():
return 'True'
else:
return 'False'
def any_lowercase3(s):
for c in s:
flag = c.islower()
return flag
def any_lowercase4(s):
flag = False
for c in s:
flag = flag or c.islower()
return flag
def any_lowercase5(s):
for c in s:
if not c.islower():
return False
return True
In [ ]:
Exercise3: ROT13 is a weak form of encryption that involves “rotating” each letter in a word by 13 places. To rotate a letter means to shift it through the alphabet, wrapping around to the beginning if necessary, so ’A’ shifted by 3 is ’D’ and ’Z’ shifted by 1 is ’A’.
Write a function called rotate_word
that takes a string and an integer as parameters, and that returns a new string that contains the letters from the original string “rotated” by the given amount.
For example, “cheer” rotated by 7 is “jolly” and “melon” rotated by -10 is “cubed”.
You might want to use the built-in functions ord
, which converts a character to a numeric code, and chr
, which converts numeric codes to characters.
Potentially offensive jokes on the Internet are sometimes encoded in ROT13. If you are not easily offended, find and decode some of them.