中级
实现点位树形结构解析
未完成
中级参考
代码结构已给出,请填写 ____ 处
def solve():
from pyodide.http import open_url
from io import StringIO
import pandas as pd
bld_csv = open_url(____).read()
loc_csv = open_url(____).read()
scr_csv = open_url(____).read()
buildings = pd.read_csv(StringIO(____))
locations = pd.read_csv(StringIO(____))
screens = pd.read_csv(StringIO(____))
def build_tree(____):
bld = buildings[buildings['____']==bid].iloc[____]
locs = locations[locations['____']==bid]
result = {'____':bid,'____':bld['____'],'____':bld['____'],'____':[]}
for _, loc in locs.iterrows():
scrs = list(____)
result['____'].append({'____':loc['____'],'____':int(____),'____':loc['____'],'____':scrs})
return result
tree = build_tree(____)
print(____)
for loc in tree['____'][:____]:
print("____"+loc['____']+"____"+str(____)+"____"+loc['____']+"____"+str(____))
print("____"+str(len(____)))
示例
输入
solve()
期望输出
Tree BLD-001: 朝阳时代01号 region=朝阳 LOC LOC-0001 floor=7 elev=E2 screens=['SCR-0001'] LOC LOC-0051 floor=7 elev=E2 screens=['SCR-0051'] LOC LOC-0101 floor=2 elev=E4 screens=['SCR-0101'] Total locations: 4
👑
升级 VIP
解锁全部题目,畅通无阻地学习
- ✓ 解锁全部训练包所有题目
- ✓ 查看完整参考代码和提示
- ✓ 浏览器内直接运行 Python 代码
- ✓ 自动批改 + 进度追踪
30天
¥18
1年
¥99
2年
¥158
3年
¥199