Search for a command to run...
never give up!
def object2Map(obj:object):
"""covert object to dict"""
m = obj.__dict__
for k in m.keys():
v = m[k]
if hasattr(v, "__dict__"):
m[k] = object2Map(v)
return m
class Test:
def __init__(self):
self.a = 1
self.b = 2
test = Test()
test.c = Test()
print(object2Map(test))
results：
No comments yet. Be the first to comment.
introduction AVL Tree named after its inventor Adelson-Velskii and Landis is a sort of binary search tree. There is a balance factor -1,0,1 which represents the balance state on each node. For more simple implementation, we record the height of the ...
introduction There are three sort algorithms with regard to tree topology. They are: tree search sort tree select sort (alias competitors sort) heap sort Tree search sort is an algorithm which gets a sorted serial by middle order traversal on a bi...
introduction As who have studied data structure knows, hashing is best fast way to look up a data. The cost of it is just some spaces. The time compexity is \(O(1)\). Here's how it works： First, we need to define a hash function ，which functions to...
introduction As everyone knows, Quick Sort is an excellent algorithm with average time complexity of \(O(n\cdot log(n))\)。Merge Sort is also a best-known sort algorithm with average time complexity of \(O(n\cdot log(n))\) and worst time complexity ...
introduction The traditional ways to implement heap are to use arrays! As we all know, the length of array is fixed. Since that, the usage of heap has many limitaions and usually is inconvinient. This article uses the link-based implementation. pri...
