Suppose we have the list:
mylist = [
[
"Hello",
[
"Hi"
]
]
]
How do I check that list containing "Hello" and "Hi" exists in mylist, in specifically this structure without flattening it?
All the solutions are flattening the list, but I need to check for specific structure, like this
Array
|_
—-|_ “Hello”
———|_ “Hi”
——. . .
To check if the specific nested structure exists in mylist without flattening it, you can use recursion to traverse the structure and compare it element by element.
def is_structure_present(haystack, needle):
if not isinstance(needle, list) or not isinstance(haystack, list):
return haystack == needle
if len(needle) != len(haystack):
return False
return all(is_structure_present(h, n) for h, n in zip(haystack, needle))
# Your list
mylist = [
[
"Hello",
[
"Hi"
]
]
]
# The structure to check
structure_to_check = [
"Hello",
[
"Hi"
]
]
# Check if the structure exists
print(any(is_structure_present(item, structure_to_check) for item in mylist))
Use the any() function and the in operator.
if any("Hello" in sublist and any("Hi" in subsublist for subsublist in sublist if isinstance(subsublist, list)) for sublist in mylist):
print("Hello and Hi were found")
any(). If you need a more general searching function, you can write a function that takes some representation of the search pattern to look for. It will probably be recursive to be able to drill down dynamically.
HelloandHibe at any level of nesting, or do you just need to check at the levels in your example?mylist[0]satisfies your criteria? Alternatively, is what you need as a result more likemylist[0][0]+mylist[0][1][0]?