zoukankan      html  css  js  c++  java
  • [LeetCode] Shortest Word Distance II

    Problem Description:

    This is a follow up of Shortest Word Distance. The only difference is now you are given the list of words and your method will be called repeatedly many times with different parameters. How would you optimize it?

    Design a class which receives a list of words in the constructor, and implements a method that takes two words word1 and word2 and return the shortest distance between these two words in the list.

    For example,
    Assume that words = ["practice", "makes", "perfect", "coding", "makes"].

    Given word1 = "coding”word2 = "practice”, return 3.
    Given word1 = "makes"word2 = "coding", return 1.

    Note:
    You may assume that word1 does not equal to word2, and word1 and word2 are both in the list.


    The key idea is to store the indexes of each word using a hash map. Then the function shortest() is just to find the minimum difference between two sorted lists (see here for a method).

    The code is as follows.

     1 class WordDistance {
     2 public:
     3     WordDistance(vector<string> words) {
     4         int n = words.size();
     5         for (int i = 0; i < n; i++)
     6             wordInd[words[i]].push_back(i);
     7     }
     8 
     9     int shortest(string word1, string word2) {
    10         vector<int> indexes1 = wordInd[word1];
    11         vector<int> indexes2 = wordInd[word2];
    12         int m = indexes1.size(), n = indexes2.size();
    13         int i = 0, j = 0, dist = INT_MAX;
    14         while (i < m && j < n) {
    15             dist = min(dist, abs(indexes1[i] - indexes2[j]));
    16             if (indexes1[i] < indexes2[j]) i++;
    17             else j++;
    18         }
    19         return dist;
    20     }
    21 private:
    22     unordered_map<string, vector<int> > wordInd;
    23 };
    24 
    25 
    26 // Your WordDistance object will be instantiated and called as such:
    27 // WordDistance wordDistance(words);
    28 // wordDistance.shortest("word1", "word2");
    29 // wordDistance.shortest("anotherWord1", "anotherWord2");
  • 相关阅读:
    27、驱动调试之修改系统时钟中断定位系统僵死问题
    25、驱动调试之打印到proc虚拟文件
    24、驱动调试之printk
    23、uevent/hotplug热拔插机制
    22、DMA驱动程序框架
    21、IIS声卡驱动程序
    20、RTC驱动程序
    ZOJ
    HDU-4272 LianLianKan (dfs)
    UVA-624 CD (01背包+路径记忆)
  • 原文地址:https://www.cnblogs.com/jcliBlogger/p/4705282.html
Copyright © 2011-2022 走看看