python 實(shí)現(xiàn)一個(gè)求解當(dāng)前數(shù)據(jù)所有子項(xiàng)的方法

儲(chǔ)存空間夠大的話可以建立一個(gè)字典
假如你的數(shù)據(jù)是個(gè)list名字叫CN（中國(guó)所有省市縣...）

parent_d = {}
for item in CN:
    parent = item['parent']
    if parent in parent_d:
        parent_d[parent].append(item['id'])
    else:
        parent_d[parent] = [item['id']]

之后遍歷一下

def get_all_children(city_id, parent_d):
    if city_id not in parent_d or not city_id:
        return []
    result = []
    temp_parent = [city_id]
    while temp:
        cur_id = temp_parent.pop(-1)
        result += parent_d[cur_id]
        temp_parent = parent_d[cur_id] + temp_parent
    return result

貼一下全一點(diǎn)的例子

這個(gè)問(wèn)題可以轉(zhuǎn)換成N叉樹(shù)的遍歷，將某個(gè)節(jié)點(diǎn)的所有子節(jié)點(diǎn)計(jì)算出來(lái)。

    def return_all_children(self):
        """
        返回所有的子項(xiàng)
        :return:
        """
        root = self
        if not root:
            return []
        que = []  # 保存節(jié)點(diǎn)的隊(duì)列
        res = []  # 保存結(jié)果的列表
        que.append(root)  #
        while len(que):  # 判斷隊(duì)列不為空
            length = len(que)
            sub = []  # 保存每層的節(jié)點(diǎn)的值
            for i in range(length):
                current = que.pop(0)  # 出隊(duì)列的當(dāng)前節(jié)點(diǎn)
                print(current)
                sub.append(current)
                for child in current.return_children:  # 所有子結(jié)點(diǎn)入隊(duì)列
                    que.append(child)
            res.append(sub)  # 把每層的節(jié)點(diǎn)的值加入結(jié)果列表
        return res