[算法] 请教高手计算树型前面的对应符号

2017-11-28 03:09:51 190 阅读 AI 写同款 · GEO 优化AI 选题数据监测一键分发 ›

告别仿真报错！手把手教你为Intel MAX10 FPGA定制IBIS模型（附Allegro Skill工具）本文详细介绍了为Intel MAX10 FPGA定制IBIS模型的完整流程，解决信号完整性仿真中的管脚映射问题。通过Allegro Skill工具自动化处理管脚信息，优化IBIS模型关键段落，提升仿真效率和精度，适用于高速数字电路设计。阅读详情



# 数据格式：

list = [

    {'id':1, 'title':'t1', 'parent_id':0},

    {'id':2, 'title':'t2', 'parent_id':0},

    {'id':3, 'title':'t1_1', 'parent_id':1},

    {'id':4, 'title':'t1_2', 'parent_id':1},

    {'id':5, 'title':'t1_2_1', 'parent_id':4},

    {'id':6, 'title':'t2_1', 'parent_id':2},

    {'id':7, 'title':'t2_2', 'parent_id':2},

    {'id':8, 'title':'t2_1_1', 'parent_id':6},



# 计算树排序与深度：

list_tree = []

def list_order(pid, list, level=0):

    for x in list:

        if pid == x['parent_id']:

            x['level'] = level

            list_tree.append(x)

            list_order(x['id'], list, level+1)



list_order(0, list, 0)



for x in list_tree:

    print(x['title'], x['level'])



# 需求：

# 请看二楼 (csdn发表主题不可使用特殊符号)

...全文

HFSS仿真3dB微带双分支定向耦合器学习笔记设计一个3dB微带双分支定向耦合器，各端口微带线特性阻抗为50Ω，中心频率为5GHz，介质基板的介电常数9.6，基板厚度为0.8mm这里重点讲解HFSS的操作，关于理论知识后面文章更新。阅读详情

无闻i

脚本语言 37,738 成员 34,208 内容

+ 关注 + 加入社区

切换为时间正序

真糨糊 2017-11-28

打赏
举报

引用 2 楼 njg_jh 的回复:


# 数据格式：
list=[
{'id':1,'title':'t1','parent_id':0},
{'id':2,'title':'t2','parent_id':0},
{'id':3,'title':'t1_1','parent_id':1},
{'id':4,'title':'t1_2','parent_id':1},
{'id':5,'title':'t1_2_1','parent_id':4},
{'id':6,'title':'t2_1','parent_id':2},
{'id':7,'title':'t2_2','parent_id':2},
{'id':8,'title':'t2_1_1','parent_id':6},
]
# 计算树排序与深度：
list_tree = []
def get_nodeByID(node_id):
	for x in list:
		if x['id'] == node_id:
			return x
	return None

def list_order(pid, list, level=0):
	for x in list:
		if pid == x['parent_id']:
			x['level'] = level
			if pid == 0:
				x['parent'] = None
			else:
				x['parent'] = get_nodeByID(pid)
			x['hasnextbrother'] = False
			for y in list_tree:
				if y['parent_id'] == x['parent_id']:
					y['hasnextbrother'] = True
			list_tree.append(x)
			list_order(x['id'], list, level+1)
 
list_order(0, list, 0)

def get_prefix(node):
	prefix = ''
	if node['parent'] != None:
		if node['hasnextbrother'] == True:
			prefix = '├'
		else:
			prefix = '└'
		node = node['parent']
	while node['parent'] != None:
		if node['hasnextbrother'] == True:
			prefix = '│' + prefix
		else:
			prefix = ' ' + prefix
		node = node['parent']
	return prefix
 
for x in list_tree:
    print(get_prefix(x), x['title'], sep = '')

prefix = ' ' + prefix 这句里的空格' '改成全角的空格‘　’，效果会更好些

真糨糊 2017-11-28

打赏
举报


# 数据格式：
list=[
{'id':1,'title':'t1','parent_id':0},
{'id':2,'title':'t2','parent_id':0},
{'id':3,'title':'t1_1','parent_id':1},
{'id':4,'title':'t1_2','parent_id':1},
{'id':5,'title':'t1_2_1','parent_id':4},
{'id':6,'title':'t2_1','parent_id':2},
{'id':7,'title':'t2_2','parent_id':2},
{'id':8,'title':'t2_1_1','parent_id':6},
]
# 计算树排序与深度：
list_tree = []
def get_nodeByID(node_id):
	for x in list:
		if x['id'] == node_id:
			return x
	return None

def list_order(pid, list, level=0):
	for x in list:
		if pid == x['parent_id']:
			x['level'] = level
			if pid == 0:
				x['parent'] = None
			else:
				x['parent'] = get_nodeByID(pid)
			x['hasnextbrother'] = False
			for y in list_tree:
				if y['parent_id'] == x['parent_id']:
					y['hasnextbrother'] = True
			list_tree.append(x)
			list_order(x['id'], list, level+1)
 
list_order(0, list, 0)

def get_prefix(node):
	prefix = ''
	if node['parent'] != None:
		if node['hasnextbrother'] == True:
			prefix = '├'
		else:
			prefix = '└'
		node = node['parent']
	while node['parent'] != None:
		if node['hasnextbrother'] == True:
			prefix = '│' + prefix
		else:
			prefix = ' ' + prefix
		node = node['parent']
	return prefix
 
for x in list_tree:
    print(get_prefix(x), x['title'], sep = '')

无闻i 2017-11-28

打赏
举报

需求


# 计算树前面应该输出的符号  │, ├, └

得出如下格式：


t1
├t1_1
└t1_2
    └t1_2_1
t2
├t2_1
│ └t2_1_1
└t2_2

[算法] 请教高手计算树型前面的对应符号

相关推荐