think_in_python练习题.docxVIP

def middle(t):lenth = len(t)t.pop(0)t.pop(lenth-1)return t middle([1,2,3,2,2,8])Traceback (most recent call last): File pyshell#49, numsne 1, in module middle([1,2,3,2,2,8]) File pyshell#48, numsne 4, in middle t.pop(lenth-1)IndexError: pop index out of range def middle(t):lenth = len(t)print(lenth)x=t.pop(0)print(x)return t middle([1,2,3,2,2,8])61[2, 3, 2, 2, 8] def middle(t):lenth = len(t)t.pop(lenth-1)t.pop(0)return t middle([1,2,3,2,2,8])[2, 3, 2, 2]注意t.pop(0)以后，t的length就会减一。def chop(t):del t[len(t)-1]del t[0]print(t) chop([1,2,2,3,3,4,4,8])[2, 2, 3, 3, 4, 4] t =[1,2,2,2,33,44,8] t.remove(2) t[1, 2, 2, 33, 44, 8]def histogram(s):d = dict()for c in s:if c not in d:d[c] = 1else:d[c] += 1return ddef rev_lookup(d,v):res = []for k in d:if d[k] == v:res.append(k)#print resreturn resrev_lookup(h,1)[a, b, f, o, s, t, v] rev_lookup(h,2)[e, i, l, u] rev_lookup(h,3)[]def count_c(string):d = dict()for c in string:if c not in d:d[c] = 1else:d[c] +=1return ddef most_fre(string):di = count_c(string)nums = sorted(di.items(),key = itemgetter(1),reverse = True)for x,y in nums:print(x,end =) most_fre(frequencyisless)escfilnqruy def signature(s): Returns the signature of this string, which is a string that contains all of the letters in order. t = numsst(s)t.sort() t = .join(t) return tdef all_anagrams(filename): Finds all anagrams in a numsst of words. filename: string filename of the word numsst Returns: a map from each word to a numsst of its anagrams. d = {} for numsne in open(filename): word = numsne.strip().lower() t = signature(word) if t not in d: d[t] = [word] else: d[t].append(word) return ddef print_anagram_sets_in_order(d): Prints the anagram sets in d in decreasing order of size. d: map from words to numsst of their anagrams # make a numsst of (length, word pairs) t = [] for v in d.values(): if len(v) 1:t.append((len(v), v)) # sort in ascendi