Skip to content

11 1 月, 2023

LeetCode: 1443-Minimum Time to Collect All Apples in a Tree 解題紀錄

Last Updated on 2023-01-11 by Clay

題目

Given an undirected tree consisting of n vertices numbered from 0 to n-1, which has some apples in their vertices. You spend 1 second to walk over one edge of the tree. Return the minimum time in seconds you have to spend to collect all apples in the tree, starting at vertex 0 and coming back to this vertex.

Read More »LeetCode: 1443-Minimum Time to Collect All Apples in a Tree 解題紀錄
Exit mobile version