LeetCode 1257. Smallest Common Region

原题链接在这里：https://leetcode.com/problems/smallest-common-region/

题目：

You are given some lists of regions where the first region of each list includes all other regions in that list.

Naturally, if a region X contains another region Y then X is bigger than Y. Also by definition a region X contains itself.

Given two regions region1, region2, find out the smallest region that contains both of them.

If you are given regions r1, r2 and r3 such that r1 includes r3, it is guaranteed there is no r2 such that r2 includes r3.

It's guaranteed the smallest region exists.

Example 1:

Input:
regions = [["Earth","North America","South America"],
["North America","United States","Canada"],
["United States","New York","Boston"],
["Canada","Ontario","Quebec"],
["South America","Brazil"]],
region1 = "Quebec",
region2 = "New York"
Output: "North America"

Constraints:

• 2 <= regions.length <= 10^4
• region1 != region2
• All strings consist of English letters and spaces with at most 20 letters.

题解：

With the regions list, we could construct partent HashMap with child pointing to parent.

Maintain all the regions used while finding ancestor of region1.

When finding ancestor of region2, return the first occurance of region that is in used, it would be smallest common region.

Time Complexity: O(n). n = regions.size() * average length. h is height of parent tree.

Space: O(n).

AC java:

 class Solution {
     public String findSmallestRegion(List<List<String>> regions, String region1, String region2) {
         HashMap<String, String> hm = new HashMap<>();
         for(List<String> item : regions){
             String parent = item.get(0);
             for(int i = 1; i<item.size(); i++){
                 hm.put(item.get(i), parent);
             }
         }
 
         HashSet<String> used = new HashSet<>();
         while(region1 != null){
             used.add(region1);
             region1 = hm.get(region1);
         }
 
         while(!used.contains(region2)){
             region2 = hm.get(region2);
         }
 
         return region2;
     }
 }

类似Lowest Common Ancestor of a Binary Tree.