【跟着MIT学Python】Unit 3.6 Dictionaries

Dictionaries

Collection of things costumized with keys instead of numbers

list
0	item 1
1	item 2
2	item 3
3	item 4

dictionary
key 1	value 1
key 2	value 2
key 3	value 3
key 4	value 4

my_dict = {}
grades = {'Anna': 'B', 'John': 'A+','Denise':'A', 'Katy':"A"}

Dictionary operations

• add

grades['Sylvan'] = 'A'
# mutable

• test

'John' in grades

• remove

del(grades['Anna'])

• get an iterable acts like a tuple of all keys

grades.keys()
Out: dict_keys(['Anna', 'John', 'Denise', 'Katy'])

• get an iterable acts like a tuple of all values

grades.value()
Out: dict_values(['B', 'A+', 'A', 'A'])

characteristic

grades
Out[62]: {'Anna': 'B', 'John': 'A+', 'Denise': 'A', 'Katy': 'A'}

type(grades)
Out[63]: dict

type(grades.values())
Out[65]: dict_values

type(grades['John'])
Out[72]: str

Example with a dictionary

def lyrics_to_frequencies(lyrics):
	myDict = {}
for words in lyrics:
	if words in myDict:
		myDict[words] += 1
	else:
		myDict[words] = 1
return myDict

# Find the biggest value numbers in a dictionary
animals = {'a':'aaa','b':'bbb', 'c':'ccc', 'd': ['ddd','dddd']}
result = None
biggestvalue = 0
for i in animals:
	if len(animals[i]) >= biggestvalue  ## here! the expression
	result = i
return result

• Fibonacci with a dictionary

def fib_efficient(n,d):
	if n in d: 
		return d[n]
	else:
		ans = fib_efficient(n-1, d) +fib_efficient(n-2, d)
		d[n] = ans
		return ans
		
# do a lookup first in case already calculated the value
# modify dictionary as progress through function calls

fib_efficient(20,{1:1,2:2})
Out[7]: 10946

• Global Variables

def fib(n);
	global numFibCalls # Here is something that I 
										# can access out of the scope