zoukankan      html  css  js  c++  java
  • 748. Shortest Completing Word 最短的匹配单词

     Find the minimum length word from a given dictionary words, which has all the letters from the string licensePlate. Such a word is said to complete the given string licensePlate

    Here, for letters we ignore case. For example, "P" on the licensePlate still matches "p" on the word.

    It is guaranteed an answer exists. If there are multiple answers, return the one that occurs first in the array.

    The license plate might have the same letter occurring multiple times. For example, given a licensePlate of "PP", the word "pair" does not complete the licensePlate, but the word "supper" does.

    Example 1:

    Input: licensePlate = "1s3 PSt", words = ["step", "steps", "stripe", "stepple"]
    Output: "steps"
    Explanation: The smallest length word that contains the letters "S", "P", "S", and "T".
    Note that the answer is not "step", because the letter "s" must occur in the word twice.
    Also note that we ignored case for the purposes of comparing whether a letter exists in the word.
    

    Example 2:

    Input: licensePlate = "1s3 456", words = ["looks", "pest", "stew", "show"]
    Output: "pest"
    Explanation: There are 3 smallest length words that contains the letters "s".
    We return the one that occurred first.
    

    Note:

    1. licensePlate will be a string with length in range [1, 7].
    2. licensePlate will contain digits, spaces, or letters (uppercase or lowercase).
    3. words will have a length in the range [10, 1000].
    4. Every words[i] will consist of lowercase letters, and have length in range [1, 15].

    1. /**
    2. * @param {string} licensePlate
    3. * @param {string[]} words
    4. * @return {string}
    5. */
    6. var shortestCompletingWord = function (licensePlate, words) {
    7. let m = {};
    8. for (let i = 0; i < licensePlate.length; i++) {
    9. let c = licensePlate[i].toLowerCase();
    10. if (!isNaN(c)) continue;
    11. m[c] = m[c] ? ++m[c] : 1;
    12. }
    13. let res = "";
    14. for (let i in words) {
    15. let str = words[i];
    16. if (isMatch(m, str) && (str.length < res.length || res == "")) {
    17. res = str;
    18. }
    19. }
    20. return res;
    21. };
    22. var isMatch = (m, s) => {
    23. let newM = {};
    24. for (let i = 0; i < s.length; i++) {
    25. let c = s[i].toLowerCase();
    26. if (!isNaN(c)) continue;
    27. newM[c] = newM[c] ? ++newM[c] : 1;
    28. }
    29. for (let i in m) {
    30. if (!newM[i] || m[i] > newM[i]) {
    31. return false;
    32. }
    33. }
    34. return true;
    35. }
    36. let licensePlate = "GrC8950";
    37. let words = ["measure", "other", "every", "base", "according", "level", "meeting", "none", "marriage", "rest"];
    38. console.log(shortestCompletingWord(licensePlate, words));






  • 相关阅读:
    Android开发学习笔记-关于Android的消息推送以及前后台切换
    C#文件操作工具类
    c#取得应用程序根目录
    Visual Studio 2012中使用GitHub
    C#邮件发送
    jquery判断某个属性是否存在 hasAttr
    js 如何让两个等长的数组产生键值对关系
    js判断一个元素是否在数组中
    日期控件
    react 生命周期函数的一些心得体会
  • 原文地址:https://www.cnblogs.com/xiejunzhao/p/8083018.html
Copyright © 2011-2022 走看看