Python simple multi-threaded demo: commonly used to write

def func1(a,b,c): pass func1(1,2,3) func1(1,2,3,4,5,6) print() def func1(*args, **kwargs): print(args) print(kwaigs) func1(1,2,3,4) fnc1(x=4, y=5, z=6

given two strings, to determine the minimum number of swaps can make two strings consistent, the first similar problem is the existence of an underlying graph. Each letter corresponds to a node. The inconsistency of two strings is represented by a directed edge on the graph. The last problem is transformed into the most (multiple) ring decomposition on the graph. It should be noted that the greedy strategy does not solve the problem ( That is, every time you choose