zoukankan      html  css  js  c++  java
  • 244. Shortest Word Distance II

    https://leetcode.com/problems/shortest-word-distance-ii/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.

     
    Sol:
     
    public class WordDistance {
        
    private Map<String, List<Integer>> map;
    
        public WordDistance(String[] words) {
            map = new HashMap<String, List<Integer>>();
            for(int i = 0; i < words.length; i++){
                String w = words[i];
                if(map.containsKey(w)){
                    map.get(w).add(i);
                    
                } else {
                    List<Integer> list = new ArrayList<Integer>();
                    list.add(i);
                    map.put(w, list);
                }
            }
            
        }
        
        public int shortest(String word1, String word2) {
            List<Integer> list1 = map.get(word1);
            List<Integer> list2 = map.get(word2);
            int ret = Integer.MAX_VALUE;
            for(int i =0, j = 0; i < list1.size() && j < list2.size();){
                int index1 = list1.get(i), index2 = list2.get(j);
                if (index1 < index2){
                    ret = Math.min(ret, index2 - index1);
                    i ++;
                } else{
                    ret = Math.min(ret, index1 - index2);
                    j ++;
                }
            }
            
            return ret;
        }
    }
    
    /**
     * Your WordDistance object will be instantiated and called as such:
     * WordDistance obj = new WordDistance(words);
     * int param_1 = obj.shortest(word1,word2);
     */
     
     
  • 相关阅读:
    CF 444B(DZY Loves FFT-时间复杂度)
    摆弄【Nhibernate 协会制图--导乐陪伴分娩】
    固定的报文统计报告的规定
    CSS——(2)与标准流盒模型
    自动复制转换StringBuffer
    IM信息网
    Oracle Redo Log
    【转载】有哪些省时小技巧,是每个Linux用户都应该知道的
    Linux snmp
    MySQL zabbix
  • 原文地址:https://www.cnblogs.com/prmlab/p/7284814.html
Copyright © 2011-2022 走看看