solve problem Minimum Index Sum Of Two Lists

Author: P-ppc

README.md

@@ -88,6 +88,7 @@ All solutions will be accepted!
 |563|[Binary Tree Tilt](https://leetcode-cn.com/problems/binary-tree-tilt/description/)|[java/py/js](./algorithms/BinaryTreeTilt)|Easy|
 |696|[Count Binary Substrings](https://leetcode-cn.com/problems/count-binary-substrings/description/)|[java/py/js](./algorithms/CountBinarySubstrings)|Easy|
 |121|[Best Time To Buy And Sell Stock](https://leetcode-cn.com/problems/best-time-to-buy-and-sell-stock/description/)|[java/py/js](./algorithms/BestTimeToBuyAndSellStock)|Easy|
+|599|[Minimum Index Sum Of Two Lists](https://leetcode-cn.com/problems/minimum-index-sum-of-two-lists/description/)|[java/py/js](./algorithms/MinimumIndexSumOfTwoLists)|Easy|
 
 # Database
 |#|Title|Solution|Difficulty|

algorithms/MinimumIndexSumOfTwoLists/README.md

@@ -0,0 +1,2 @@
+# Minimum Index Sum Of Two Lists
+This problem is easy to solve by hashmap

algorithms/MinimumIndexSumOfTwoLists/Solution.java

@@ -0,0 +1,27 @@
+class Solution {
+    public String[] findRestaurant(String[] list1, String[] list2) {
+        List<String> res = new ArrayList<String>();
+        Map<String, Integer> indexMap = new HashMap<String, Integer>();
+        int minIndexSum = Integer.MAX_VALUE;
+        
+        for (int i = 0; i < list1.length; i++) {
+            indexMap.put(list1[i], i);
+        }
+        
+        for (int i = 0; i < list2.length; i++) {
+            if (indexMap.get(list2[i]) != null) {
+                int indexSum = indexMap.get(list2[i]) + i;
+                
+                if (indexSum < minIndexSum) {
+                    res.clear();
+                    res.add(list2[i]);
+                    minIndexSum = indexSum;
+                } else if (indexSum == minIndexSum) {
+                    res.add(list2[i]);
+                }
+            }
+        }
+        
+        return res.toArray(new String[res.size()]);
+    }
+}

algorithms/MinimumIndexSumOfTwoLists/solution.js

@@ -0,0 +1,28 @@
+/**
+ * @param {string[]} list1
+ * @param {string[]} list2
+ * @return {string[]}
+ */
+var findRestaurant = function(list1, list2) {
+    let res = [],
+        resturantMap = {},
+        minIndexSum = Number.MAX_VALUE
+    
+    for (let i = 0; i < list1.length; i++) {
+        resturantMap[list1[i]] = i
+    }
+    
+    for (let i = 0; i < list2.length; i++) {
+        if (resturantMap[list2[i]] !== undefined) {
+            let indexSum = resturantMap[list2[i]] + i
+            if (indexSum < minIndexSum) {
+                res = [list2[i]]
+                minIndexSum = indexSum
+            } else if (indexSum === minIndexSum) {
+                res.push(list2[i])
+            }
+        }
+    }
+    
+    return res
+};

algorithms/MinimumIndexSumOfTwoLists/solution.py

@@ -0,0 +1,23 @@
+class Solution(object):
+    def findRestaurant(self, list1, list2):
+        """
+        :type list1: List[str]
+        :type list2: List[str]
+        :rtype: List[str]
+        """
+        res = []
+        resturant_map = {}
+        min_index_sum = sys.maxint
+        for i in range(0, len(list1)):
+            resturant_map[list1[i]] = i
+        
+        for i in range(0, len(list2)):
+            if resturant_map.get(list2[i]) != None:
+                index_sum = resturant_map.get(list2[i]) + i
+                if index_sum < min_index_sum:
+                    res = [list2[i]]
+                    min_index_sum = index_sum
+                elif index_sum == min_index_sum:
+                    res.append(list2[i])
+            
+        return res