← 返回 stripe 的题目列表Cheapest Flight with Limited Transfers
类型：online_judge
Given a flight list with prices, find the cheapest path from start to destination within k transfers.
Example
Input
3
start: A
end: B
k: 1
flights: [(A,C,100),(C,B,50),(A,B,200)]
Output
150