Leetcode: 332. Reconstruct Itinerary

Question:

Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order. All of the tickets belong to a man who departs from JFK. Thus, the itinerary must begin with JFK.
Note:
If there are multiple valid itineraries, you should return the itinerary that has the smallest lexical order when read as a single string. For example, the itinerary ["JFK", "LGA"]has a smaller lexical order than ["JFK", "LGB"].
All airports are represented by three capital letters (IATA code).
You may assume all tickets form at least one valid itinerary.
Example 1:

Input: [[“MUC”, “LHR”], [“JFK”, “MUC”], [“SFO”, “SJC”], [“LHR”, “SFO”]]
Output: [“JFK”, “MUC”, “LHR”, “SFO”, “SJC”]

Solution 1: Iteration by using stack

class Solution {
    public List<String> findItinerary(List<List<String>> tickets) {
    	Map<String, PriorityQueue<String>> map = new HashMap<>();
    	List<String> route = new ArrayList<>();
    	for (List<String> ticket : tickets) {
    		map.computeIfAbsense(ticket.get(0), k -> new PriorityQueue()).add(ticket.get(1));
    	}
    	Stack<Spring> stack = new Stack<>();
    	stack.push("JFK");
    	while(!stack.isEmpty()) { // here we must put the while loop as the 
    	// out loop
    		while(map.containsKey(stack.peek()) && !map.get(stack.peek()).isEmpty()) {
    			stack.push(map.get(stack.peek()).poll());
    		}
    		route.add(0, stack.pop());
    	}
    	return route;
    }
}

Solution 2: Recursive Solution

class Solution {
	List<String> route = new ArrayList<>();
	Map<String, List<String>> map = new HashMap<>();
    public List<String> findItinerary(List<List<String>> tickets) {
    	for (List<String> ticket : tickets) {
    		map.countIfAbsense(ticket.get(0), k -> new PriorityQueue()).add(ticket.get(1));
    	}
    	visit("JFK");
    	return route;
    }
    public void visit(String airport) {
    	while (map.containsKey(airport) && !map.get(airport).isEmpty()) {
    		visit(map.get(airport).poll());
    	}
    	route.add(0, airport);
    }
}

Note:

Pay attention to the conditions in the while loop.

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值