棱镜七彩面试题

得意时要看淡,失意时要看开。不论得意失意,切莫大意;不论成功失败,切莫止步。志得意满时,需要的是淡然,给自己留一条退路;失意落魄时,需要的是泰然,给自己觅一条出路棱镜七彩面试题,希望对大家有帮助,欢迎收藏,转发!站点地址:www.bmabk.com,来源:原文

#!/usr/bin/env python
# encoding: utf-8
'''
@author: JHC
@license: None
@contact: JHC000abc@gmail.com
@file: test.py
@time: 2022/4/22 18:46
@desc:
'''
def eq(data1, data2):
    assert type(data1) == type(data2)
    if isinstance(data1, list):
        assert len(data1) == len(data2)
        for d1, d2 in zip(sorted(data1, key=lambda x: x['id']), sorted(data2, key=lambda x: x['id'])):
            eq(d1, d2)
    elif isinstance(data1, dict):
        for key, value in data1.items():
            assert key in data2
            assert eq(value, data2[key])
    else:
        assert data1 == data2
    return True


def list_to_tree(datas: list) -> list:
    """
    将数据列表转换成树的形式
    id:int 唯一标识
    pid:int 父节点标识,父节点为0表示顶层数据
    其他信息保留
    增加children字段,内容为所有子节点列表
    """
    result = []
    id_list = [i["id"] for i in datas]
    for i in datas:
        i["children"] = []
        parent_id = i["pid"]
        if parent_id not in id_list:
            result.append(i)
        else:
            for j in result:
                __else_digui(i,j)
                
    r_result = rm(result)
    return r_result

def __else_digui(no_insert,result_p):
    if no_insert["pid"] == result_p["id"]:
        result_p["children"].extend([no_insert])
    else:
        if len(result_p["children"])>0:
            __else_digui(no_insert,result_p["children"][0])
    return result_p

def rm(lis):
    for i in lis:
        if i["children"]==[]:
            del i["children"]
        else:
            rm(i["children"])
    return lis


def main():
    # 输入数据
    test_data = [
        {"id": 1, "pid": 0, "name": "技术部", "ext": "ext1"},
        {"id": 2, "pid": 1, "name": "开发组", "ext": "ext2"},
        {"id": 3, "pid": 2, "name": "前端开发组", "ext": "ext3"},
        {"id": 4, "pid": 2, "name": "后端开发组", "ext": "ext4"},
        {"id": 5, "pid": 1, "name": "测试组", "ext": "ext5"},
        {"id": 6, "pid": 1, "name": "产品组", "ext": "ext6"},
        {"id": 7, "pid": 0, "name": "商务部", "ext": "ext7"},
        {"id": 8, "pid": 3, "name": "商务部", "ext": "ext7"},
    ]
    res = list_to_tree(test_data)
    # 期望输出
    test_res = [
      {
        "id": 1,
        "pid": 0,
        "name": "技术部",
        "ext": "ext1",
        "children": [
          {
            "id": 2,
            "pid": 1,
            "name": "开发组",
            "ext": "ext2",
            "children": [
              {"id": 3, "pid": 2, "name": "前端开发组", "ext": "ext3"},
              {"id": 4, "pid": 2, "name": "后端开发组", "ext": "ext4"}
            ]
          },
          {"id": 5, "pid": 1, "name": "测试组", "ext": "ext5"},
          {"id": 6, "pid": 1, "name": "产品组", "ext": "ext6"}
        ]
      },
      {"id": 7, "pid": 0, "name": "商务部", "ext": "ext7"}
    ]
    assert eq(test_res, res)


if __name__ == '__main__':
    main()


版权声明:本文内容由互联网用户自发贡献,该文观点仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 举报,一经查实,本站将立刻删除。

文章由极客之音整理,本文链接:https://www.bmabk.com/index.php/post/156927.html

(0)
飞熊的头像飞熊bm

相关推荐

发表回复

登录后才能评论
极客之音——专业性很强的中文编程技术网站,欢迎收藏到浏览器,订阅我们!