python编程100题
defcount(val,seq):""" >>>count(5,(1,5,3,7,5,8,5))3 >>>count('s','Mississippi')4 >>>count((1,2),[1,5,(1,2),7,(1,2),8,5])2 """ returnlist(seq).count(val)defreverse(seq):""" >>>reverse([1,2,3,4,5])[5,4,3,2,1] >>>reverse(('shoe','my','buckle',2,1))(1,2,'buckle','my','shoe')>>>reverse('Python')'nohtyP' """ returnseq[::-1]defsort_sequence(seq):""" >>>sort_sequence([3,4,6,7,8,2])[2,3,4,6,7,8] >>>sort_sequence((3,4,6,7,8,2))(2,3,4,6,7,8)>>>sort_sequence("nothappy")'ahnoppty' """ iftype(seq)==str:return''.join(sorted(seq))else:returntype(seq)(sorted(seq))defrecursive_min(nested_num_list):""" >>>recursive_min([2,9,[1,13],8,6])1 >>>recursive_min([2,[[100,1],90],[10,13],8,6])1 >>>recursive_min([2,[[13,-7],90],[1,100],8,6])-7 >>>recursive_min([[[-13,7],90],2,[1,100],8,6])-13 """ smallest=nested_num_list[0]whiletype(smallest)==type([]):smallest=smallest[0]forelementinnested_num_list:iftype(element)==type([]):min_of_elem=recursive_min(element)ifsmallest>min_of_elem:smallest=min_of_elemelse:#elementisnotalistifsmallest>element:smallest=elementreturnsmallest defrecursive_count(target,nested_num_list):""" >>>recursive_count(2,[2,9,[2,1,13,2],8,[2,6]])4 >>>recursive_count(7,[[9,[7,1,13,2],8],[7,6]])2