【Py】自下而上递归搜寻路径

57 篇文章 1 订阅
3 篇文章 0 订阅

假设我们有如下行政区划数据

[
  {
    "code": "110000000000",
    "name": "北京市",
    "level": "1",
    "pcode": "0"
  },
  {
    "code": "110100000000",
    "name": "市辖区",
    "level": "2",
    "pcode": "110000000000"
  },
  {
    "code": "110101000000",
    "name": "东城区",
    "level": "3",
    "pcode": "110100000000"
  },
  {
    "code": "110101001000",
    "name": "东华门街道",
    "level": "4",
    "pcode": "110101000000" 
  },
  {
    "code": "110101001001",
    "name": "多福巷社区居委会",
    "level": "5",
    "pcode": "110101001000" 
  },
  {
    "code": "110101001002",
    "name": "银闸社区居委会",
    "level": "5",
    "pcode": "110101001000" 
  },
  {
    "code": "110101001005",
    "name": "东厂社区居委会",
    "level": "5",
    "pcode": "110101001000" 
  }
]

code: 12位,省2位,市2位,县2位,镇3位,村3位
level: 省1,市2,县3,镇4,村5
pcode: 直接父级别的code

我们希望将其变为:

[
  {
    "level": "1",
    "code": "110000000000",
    "name": "北京市",
    "1_name": "北京市",
    "1_code": "110000000000",
    "2_name": "",
    "2_code": "",
    "3_name": "",
    "3_code": "",
    "4_name": "",
    "4_code": "",
    "5_name": "",
    "5_code": ""
  },
  {
    "level": "2",
    "code": "110100000000",
    "name": "市辖区",
    "1_name": "北京市",
    "1_code": "110000000000",
    "2_name": "市辖区",
    "2_code": "110100000000",
    "3_name": "",
    "3_code": "",
    "4_name": "",
    "4_code": "",
    "5_name": "",
    "5_code": ""
  },
  {
    "level": "3",
    "code": "110101000000",
    "name": "东城区",
    "1_name": "北京市",
    "1_code": "110000000000",
    "2_name": "市辖区",
    "2_code": "110100000000",
    "3_name": "东城区",
    "3_code": "110101000000",
    "4_name": "",
    "4_code": "",
    "5_name": "",
    "5_code": ""
  },
  {
    "level": "4",
    "code": "110101001000",
    "name": "东华门街道",
    "1_name": "北京市",
    "1_code": "110000000000",
    "2_name": "市辖区",
    "2_code": "110100000000",
    "3_name": "东城区",
    "3_code": "110101000000",
    "4_name": "东华门街道",
    "4_code": "110101001000",
    "5_name": "",
    "5_code": ""
  },
  {
    "level": "5",
    "code": "110101001001",
    "name": "多福巷社区居委会",
    "1_name": "北京市",
    "1_code": "110000000000",
    "2_name": "市辖区",
    "2_code": "110100000000",
    "3_name": "东城区",
    "3_code": "110101000000",
    "4_name": "东华门街道",
    "4_code": "110101001000",
    "5_name": "多福巷社区居委会",
    "5_code": "110101001001"
  },
  {
    "level": "5",
    "code": "110101001002",
    "name": "银闸社区居委会",
    "1_name": "北京市",
    "1_code": "110000000000",
    "2_name": "市辖区",
    "2_code": "110100000000",
    "3_name": "东城区",
    "3_code": "110101000000",
    "4_name": "东华门街道",
    "4_code": "110101001000",
    "5_name": "银闸社区居委会",
    "5_code": "110101001002"
  },
  {
    "level": "5",
    "code": "110101001005",
    "name": "东厂社区居委会",
    "1_name": "北京市",
    "1_code": "110000000000",
    "2_name": "市辖区",
    "2_code": "110100000000",
    "3_name": "东城区",
    "3_code": "110101000000",
    "4_name": "东华门街道",
    "4_code": "110101001000",
    "5_name": "东厂社区居委会",
    "5_code": "110101001005"
  }
]

由于提供有父级编码,所以可以采用自下而上的递归,子节点向上搜寻到根节点

import pandas as pd
df_origin = pd.read_csv('./area_code_2021.csv', names=['code', 'name', 'level', 'pcode'], dtype=str)

def get_df(item, df_item):
	"""
	递归补全数据
	"""
    if item.pcode != '0':
        try:
            item = list(df_origin.loc[df_origin['code']==item.pcode].itertuples(index=False))[0]
            df_item.loc[0, f'{item.level}_code'] = item.code
            df_item.loc[0, f'{item.level}_name'] = item.name
            get_df(item, df_item)
        except:
            import pdb
            pdb.set_trace()
    return df_item

df_province = df_origin.loc[df_origin['level']=='1']
df = df_origin.copy()
for province in df_province.itertuples(index=False):
    df_all = pd.DataFrame()
    df_item = df.copy()
    for item in df_item.loc[df_item['code'].apply(lambda x: x.startswith(province.code[0:2]))].itertuples():
        df_item = pd.DataFrame()
        # 初始化该条数据
        df_item.loc[0, 'level'] = item.level
        df_item.loc[0, 'code'] = item.code
        df_item.loc[0, 'name'] = item.name
        df_item.loc[0, f'{item.level}_name'] = item.name
        df_item.loc[0, f'{item.level}_code'] = item.code
        # 补全该条数据
        df_item = get_df(item, df_item)
        # 移除数据
        df.drop(item.Index, inplace=True)
        # 放入集合中
        df_all = df_all.append(df_item)
    df_all.to_excel(f'{province.name}.xlsx', index=False)

类似的企业微信API中的获取部门列表接口返回的数据结构与上面的类似,稍作修改就能使用

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
可以通过递归实现三级菜单的路径拼写,具体实现步骤如下: 1. 定义一个递归函数,传入一个数组参数,该数组包含当前菜单的所有子菜单。 2. 在递归函数中,遍历传入的数组,对于每一个子菜单,将其名称添加到一个路径数组中。 3. 如果该子菜单还有子菜单,那么递归调用该函数,传入该子菜单的子菜单数组,继续拼接路径。 4. 如果该子菜单没有子菜单了,那么将路径数组中的所有元素使用 "/" 拼接起来,就得到了该子菜单的完整路径。 5. 将得到的路径保存到一个对象中,以该子菜单的 ID 为 key,路径为 value。 6. 递归结束后,返回保存所有路径的对象。 示例代码如下: ```javascript function generateMenuPaths(menuItems, parentPath = '') { const paths = {}; menuItems.forEach(item => { const { id, name, children } = item; const path = `${parentPath}/${name}`; paths[id] = path; if (children && children.length) { const childPaths = generateMenuPaths(children, path); Object.assign(paths, childPaths); } }); return paths; } // 假设有以下三级菜单数据 const menuItems = [ { id: 1, name: '菜单1', children: [ { id: 11, name: '子菜单1-1', children: [ { id: 111, name: '子菜单1-1-1' }, { id: 112, name: '子菜单1-1-2' } ] }, { id: 12, name: '子菜单1-2' } ] }, { id: 2, name: '菜单2', children: [ { id: 21, name: '子菜单2-1' }, { id: 22, name: '子菜单2-2' } ] } ]; // 调用函数生成菜单路径 const menuPaths = generateMenuPaths(menuItems); // menuPaths 的值为: // { // "1": "/菜单1", // "11": "/菜单1/子菜单1-1", // "111": "/菜单1/子菜单1-1/子菜单1-1-1", // "112": "/菜单1/子菜单1-1/子菜单1-1-2", // "12": "/菜单1/子菜单1-2", // "2": "/菜单2", // "21": "/菜单2/子菜单2-1", // "22": "/菜单2/子菜单2-2" // } ``` 这样,我们就得到了所有三级菜单的完整路径。可以将路径保存到 Vuex 的 state 中,然后在组件中通过计算属性获取使用。

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值