From collections import Defaultdictfrom collections Import ORDEREDDICTD = Defaultdict (list) d[' a '].append (1) d[' a ']. Append (2) d[' B '].append (5) print (d) #di = Dict (list) #di [' B '].append (one) #di [' B '].append (a) #di [' C '].append () #print (di) ds = Defaultdict (set) ds[' B '].add (one) ds[' B '].add (All) ds[' C '].add (in) print (ds) do = Ordereddict () do[' foo '] = 1do[' Far '] = 2do[' coo '] = 5for key in Do:print (key, Do[key]) # Dictionary of operations prices = {' IBM ': 205.5, ' APPLE ': $, ' HP ': 43 , ' FB ': 88.3}min_prices = min (Zip (prices.values (), Prices.keys ())) print (min_prices) max_prices = max (Zip (prices.values (), Prices.keys ())) print (max_prices) prices_sorted = sorted (Zip (prices.values (), Prices.keys ())) print (prices_sorted ) Z1 = [1,2,3]Z2 = [' A ', ' B ', ' C ']z3 = Zip (z1, Z2) print (list (z3)) Z4 = Zip (*zip (z1, Z2)) Print (list (z4)) x = [1,2]y = [' A ', ' B ', ' C ']print (list (x, y)) #zip () Mate * operator, you can unzip a list object that has already been zipped and return Ganso # using zip and iterators to generate the sliding window (n-grams) from Itertools Import Islicedef N_grams (A, n): Z = (Islice (A, I, None) for I in RAnge (n)) return Zip (*z) a = [1,2,3,4,5,6]print (' (a,3): ', List (N_grams (a,3))) print (' (a,2): ', List (N_grams (a,2))) print ( ' (a,4): ', List (N_grams (a,4)) # using the zip inversion dictionary m = {' A ': 1, ' B ': 2, ' C ': 3, ' d ': 4}print (' M.items = ', M.items ()) Print (the list (the Zip (M. VALUES (), M.keys ()))) MD = Dict (Zip (m.values (), M.keys ())) print (MD)
Zip of Python3