feat: add Java solution to lc problem: No.332 #1624

Original file line number	Diff line number	Diff line change
Expand Up		@@ -65,7 +65,37 @@
		<!-- 这里可写当前语言的特殊实现逻辑 -->

		```java

	class Solution {
	void dfs(Map<String, Queue<String>> adjLists, List<String> ans, String curr) {
	Queue<String> neighbors = adjLists.get(curr);
	if (neighbors == null) {
	ans.add(curr);
	return;
	}
	while (!neighbors.isEmpty()) {
	String neighbor = neighbors.poll();
	dfs(adjLists, ans, neighbor);
	}
	ans.add(curr);
	return;
	}

	public List<String> findItinerary(List<List<String>> tickets) {
	Map<String, Queue<String>> adjLists = new HashMap<>();
	for (List<String> ticket : tickets) {
	String from = ticket.get(0);
	String to = ticket.get(1);
	if (!adjLists.containsKey(from)) {
	adjLists.put(from, new PriorityQueue<>());
	}
	adjLists.get(from).add(to);
	}
	List<String> ans = new ArrayList<>();
	dfs(adjLists, ans, "JFK");
	Collections.reverse(ans);
	return ans;
	}
	}
		```

		### ...
Expand Down

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
Expand Up		@@ -55,7 +55,37 @@
		### Java

		```java

	class Solution {
	void dfs(Map<String, Queue<String>> adjLists, List<String> ans, String curr) {
	Queue<String> neighbors = adjLists.get(curr);
	if (neighbors == null) {
	ans.add(curr);
	return;
	}
	while (!neighbors.isEmpty()) {
	String neighbor = neighbors.poll();
	dfs(adjLists, ans, neighbor);
	}
	ans.add(curr);
	return;
	}

	public List<String> findItinerary(List<List<String>> tickets) {
	Map<String, Queue<String>> adjLists = new HashMap<>();
	for (List<String> ticket : tickets) {
	String from = ticket.get(0);
	String to = ticket.get(1);
	if (!adjLists.containsKey(from)) {
	adjLists.put(from, new PriorityQueue<>());
	}
	adjLists.get(from).add(to);
	}
	List<String> ans = new ArrayList<>();
	dfs(adjLists, ans, "JFK");
	Collections.reverse(ans);
	return ans;
	}
	}
		```

		### ...
Expand Down

Show comments View file Open in desktop

Original file line number	Diff line number	Diff line change
		@@ -0,0 +1,31 @@
	class Solution {
	void dfs(Map<String, Queue<String>> adjLists, List<String> ans, String curr) {
	Queue<String> neighbors = adjLists.get(curr);
	if (neighbors == null) {
	ans.add(curr);
	return;
	}
	while (!neighbors.isEmpty()) {
	String neighbor = neighbors.poll();
	dfs(adjLists, ans, neighbor);
	}
	ans.add(curr);
	return;
	}

	public List<String> findItinerary(List<List<String>> tickets) {
	Map<String, Queue<String>> adjLists = new HashMap<>();
	for (List<String> ticket : tickets) {
	String from = ticket.get(0);
	String to = ticket.get(1);
	if (!adjLists.containsKey(from)) {
	adjLists.put(from, new PriorityQueue<>());
	}
	adjLists.get(from).add(to);
	}
	List<String> ans = new ArrayList<>();
	dfs(adjLists, ans, "JFK");
	Collections.reverse(ans);
	return ans;
	}
	}

Navigation Menu