我有一個類似的樹數據找到了樹的葉子:如何從平面數據
[0] =>
id = 5,
name = "TV",
parent_id = 1,
children =>
[0] =>
id = 6,
name = "PLASMA",
parent_id = 5,
children = null
[1] =>
id = 7,
name = "LCD",
parent_id = 5,
children =>
[0] =>
id = 8,
name = "Gloss",
parent_id = 7,
children = null
[1] =>
id = 9,
name = "Matte",
parent_id = 7,
children = null
[1] =>
id = 4,
name = "Printers",
parent_id = 1,
children =>
....
而且我有一個平坦的字符串數據,如:
- 電視
- TV_PLASMA_Gloss
- TV_LCD
'_'是一個subc的分隔符ategory。
什麼是尋找類別ID數組的最佳算法?
示例輸入:
- 電視
- TV_PLASMA_Gloss
- TV_LCD
輸出示例:
- 陣列:5
- 陣列:5,6,8
- 陣列:5,7
語言並不重要 - 它只是一個算法 - 但在這種情況下,我會選擇C#。
謝謝。