2023年1月14日
[LeetCode] 2246. Longest Path With Different Adjacent Characters
摘要： You are given a tree (i.e. a connected, undirected graph that has no cycles) rooted at node 0 consisting of n nodes numbered from 0 to n - 1. The tree 阅读全文
posted @ 2023-01-14 06:29 CNoodle 阅读(65) 评论(0) 推荐(0) 编辑