回答編集履歴
1
Update
answer
CHANGED
|
@@ -14,6 +14,13 @@
|
|
|
14
14
|
> |
|
|
15
15
|
|
|
16
16
|
```python
|
|
17
|
+
prev = '' # 分類名一時保存用
|
|
18
|
+
for i in li:
|
|
19
|
+
if i[0] != prev: # parent
|
|
17
|
-
|
|
20
|
+
tree.insert("", "end", i[0], text=i[0])
|
|
21
|
+
prev = i[0]
|
|
18
|
-
tree.insert(
|
|
22
|
+
tree.insert(i[0], "end", text=i[1])
|
|
23
|
+
|
|
24
|
+
root.mainloop()
|
|
19
|
-
```
|
|
25
|
+
```
|
|
26
|
+
|