【贪心算法】Find the first circular tour that visits all petrol pumps
An efficient approach is to use a Queue to store the current tour. We first enqueue first petrol pump to the queue, we keep enqueueing petrol pumps till we either complete the tour, or the current amount of petrol becomes negative. If the amount becomes ne
原创
2020-09-24 15:16:23 ·
115 阅读 ·
0 评论