41

我正在尝试编写一个非常简单的函数来递归搜索可能嵌套的(在最极端的情况下十级深)Python 字典并返回它从给定键中找到的第一个值。

我不明白为什么我的代码不适用于嵌套字典。

def _finditem(obj, key):
    if key in obj: return obj[key]
    for k, v in obj.items():
        if isinstance(v,dict):
            _finditem(v, key)

print _finditem({"B":{"A":2}},"A")

它返回None

但是,它确实适用于_finditem({"B":1,"A":2},"A"),返回2

我确定这是一个简单的错误,但我找不到。我觉得标准库中可能已经有一些东西了collections,但我也找不到。

4

7 回答 7

69

当你递归时,你需要return得到结果_finditem

def _finditem(obj, key):
    if key in obj: return obj[key]
    for k, v in obj.items():
        if isinstance(v,dict):
            return _finditem(v, key)  #added return statement

要修复实际的算法,您需要意识到如果没有找到任何东西就会_finditem返回,因此您需要明确检查以防止提前返回:None

def _finditem(obj, key):
    if key in obj: return obj[key]
    for k, v in obj.items():
        if isinstance(v,dict):
            item = _finditem(v, key)
            if item is not None:
                return item

当然,如果您None在任何字典中有值,那将失败。在这种情况下,你可以为这个函数设置一个哨兵object(),并在你没有找到任何东西的情况下返回它——然后你可以检查sentinel你是否找到了一些东西。

于 2013-02-19T16:30:33.710 回答
33

这是一个搜索包含嵌套字典和列表的字典的函数。它创建结果值的列表。

def get_recursively(search_dict, field):
    """
    Takes a dict with nested lists and dicts,
    and searches all dicts for a key of the field
    provided.
    """
    fields_found = []

    for key, value in search_dict.iteritems():

        if key == field:
            fields_found.append(value)

        elif isinstance(value, dict):
            results = get_recursively(value, field)
            for result in results:
                fields_found.append(result)

        elif isinstance(value, list):
            for item in value:
                if isinstance(item, dict):
                    more_results = get_recursively(item, field)
                    for another_result in more_results:
                        fields_found.append(another_result)

    return fields_found
于 2013-11-27T23:06:02.300 回答
6

这是一种使用“堆栈”和“迭代器堆栈”模式的方法(感谢 Gareth Rees):

def search(d, key, default=None):
    """Return a value corresponding to the specified key in the (possibly
    nested) dictionary d. If there is no item with that key, return
    default.
    """
    stack = [iter(d.items())]
    while stack:
        for k, v in stack[-1]:
            if isinstance(v, dict):
                stack.append(iter(v.items()))
                break
            elif k == key:
                return v
        else:
            stack.pop()
    return default

print(search({"B": {"A": 2}}, "A"))打印2.

于 2017-04-03T12:37:09.170 回答
1

只是想让它更短:

def get_recursively(search_dict, field):
    if isinstance(search_dict, dict):
        if field in search_dict:
            return search_dict[field]
        for key in search_dict:
            item = get_recursively(search_dict[key], field)
            if item is not None:
                return item
    elif isinstance(search_dict, list):
        for element in search_dict:
            item = get_recursively(element, field)
            if item is not None:
                return item
    return None
于 2020-03-19T11:14:30.563 回答
0

我必须创建一个通用版本,在包含多个嵌套字典和列表的字典中找到唯一指定的键(指定所需值的路径的最小字典)。

对于下面的示例,创建了一个目标字典进行搜索,并使用通配符“???”创建了键。运行时,它返回值“D”

def lfind(query_list:List, target_list:List, targ_str:str = "???"):
    for tval in target_list:
        #print("lfind: tval = {}, query_list[0] = {}".format(tval, query_list[0]))
        if isinstance(tval, dict):
            val = dfind(query_list[0], tval, targ_str)
            if val:
                return val
        elif tval == query_list[0]:
            return tval

def dfind(query_dict:Dict, target_dict:Dict, targ_str:str = "???"):
    for key, qval in query_dict.items():
        tval = target_dict[key]
        #print("dfind: key = {}, qval = {}, tval = {}".format(key, qval, tval))
        if isinstance(qval, dict):
            val =  dfind(qval, tval, targ_str)
            if val:
                return val
        elif isinstance(qval, list):
            return lfind(qval, tval, targ_str)
        else:
            if qval == targ_str:
                return tval
            if qval != tval:
                break

def find(target_dict:Dict, query_dict:Dict):
    result = dfind(query_dict, target_dict)
    return result



target_dict = {"A":[
    {"key1":"A", "key2":{"key3": "B"}},
    {"key1":"C", "key2":{"key3": "D"}}]
}
query_dict = {"A":[{"key1":"C", "key2":{"key3": "???"}}]}

result = find(target_dict, query_dict)
print("result = {}".format(result))
于 2019-05-28T20:50:22.433 回答
0

由于缺乏声誉,我无法对@mgilston 提出的已接受解决方案添加评论。如果要搜索的键在列表中,则该解决方案不起作用。

遍历列表的元素并调用递归函数应该扩展功能以查找嵌套列表中的元素:

def _finditem(obj, key):
    if key in obj: return obj[key]
    for k, v in obj.items():
        if isinstance(v,dict):
            item = _finditem(v, key)
            if item is not None:
                return item
        elif isinstance(v,list):
            for list_item in v:
                item = _finditem(list_item, key)
                if item is not None:
                    return item

print(_finditem({"C": {"B": [{"A":2}]}}, "A"))

于 2019-05-18T15:58:06.727 回答
0

以为我会把我的帽子扔在戒指上,这将允许对任何实现__getitem__方法的递归请求。

def _get_recursive(obj, args, default=None):
    """Apply successive requests to an obj that implements __getitem__ and
    return result if something is found, else return default"""
    if not args:
        return obj
    try:
        key, *args = args
        _obj = object.__getitem__(obj, key)
        return _get_recursive(_obj, args, default=default)
    except (KeyError, IndexError, AttributeError):
        return default
于 2021-09-27T20:47:22.490 回答