Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
list recursion solution in Uncategorized category for The Flat Dictionary by stangersco
def flatten(dictionary: dict[str, str | dict]) -> dict[str, str]:
dic = list()
lis = list()
return_dict = dict()
def rec(dic: dict, direct: list):
for key, value in dic.items():
if not value:
value = ''
if isinstance(value, dict):
rec(value, [*direct, key])
else:
lis.append([*direct, key, value])
rec(dictionary, dic)
for i in lis:
return_dict['/'.join(i[:-1])] = i[-1]
return return_dict
print("Example:")
print(flatten({"key": "value"}))
# These "asserts" are used for self-checking
assert flatten({"key": "value"}) == {"key": "value"}
assert flatten({"key": {"deeper": {"more": {"enough": "value"}}}}) == {
"key/deeper/more/enough": "value"
}
assert flatten({"empty": {}}) == {"empty": ""}
assert flatten(
{
"name": {"first": "One", "last": "Drone"},
"job": "scout",
"recent": {},
"additional": {"place": {"zone": "1", "cell": "2"}},
}
) == {
"name/first": "One",
"name/last": "Drone",
"job": "scout",
"recent": "",
"additional/place/zone": "1",
"additional/place/cell": "2",
}
print("The mission is done! Click 'Check Solution' to earn rewards!")
Dec. 25, 2023
Comments:
