Sometimes, while working with dictionaries, we can have a problem in which we need to convert a String to nested dictionary, each separator occurrence meaning a new nesting. This is a particular problem but can occur in data domains and day-day programming. Let’s discuss certain way in which this task can be done.
Method : Using loop + recursion This is way in which this task can be performed. In this, we recur for nesting of dictionary as we encounter a separator occurrence.
Python3
def helper_fnc(test_str, sep):
if sep not in test_str:
return test_str
key, val = test_str.split(sep, 1 )
return {key: helper_fnc(val, sep)}
test_str = 'gfg_is_best_for_geeks'
print ("The original string is : " + str (test_str))
sep = '_'
res = helper_fnc(test_str, sep)
print ("The nested dictionary is : " + str (res))
|
Output : The original string is : gfg_is_best_for_geeks
The nested dictionary is : {'gfg': {'is': {'best': {'for': 'geeks'}}}}
Using a Stack:
Approach:
We can also convert the string to a nested dictionary using a stack. We will split the string into a list of keys and use a stack to keep track of the current dictionary. We will iterate through the list of keys and push each key onto the stack. If the next key is the last key, we will set the value of the current dictionary to the last key. Otherwise, we will create a new dictionary and set the value of the current dictionary to the new dictionary. We will then push the new dictionary onto the stack and make it the current dictionary.
Python3
def convert_to_dict(string):
keys = string.split( '_' )
stack = []
current_dict = {}
for key in keys:
if not stack:
current_dict[key] = None
stack.append(current_dict)
elif len (stack) = = len (keys):
stack[ - 1 ][key] = None
else :
new_dict = {}
current_dict[key] = new_dict
stack.append(new_dict)
current_dict = new_dict
return stack[ 0 ]
string = 'gfg_is_best_for_geeks'
result = convert_to_dict(string)
print (result)
|
Output{'gfg': None, 'is': {'best': {'for': {'geeks': {}}}}}
Time Complexity: O(n)
Auxiliary Space: O(n)