-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path748_Shortest Completing Word.js
67 lines (58 loc) · 1.78 KB
/
748_Shortest Completing Word.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
// https://leetcode.com/problems/shortest-completing-word/description/
/**
* @param {string} licensePlate
* @param {string[]} words
* @return {string}
*/
var shortestCompletingWord = function (licensePlate, words) {
var letters = {};
for (var i = 0; i < licensePlate.length; i++) {
var letter = licensePlate[i];
var isChar = false;
if (letter >= 'A' && letter <= 'Z') {
letter = letter.toLowerCase();
isChar = true;
} else if (letter >= 'a' && letter <= 'z') {
isChar = true;
}
if (isChar) {
letters[letter] ? letters[letter]++ : letters[letter] = 1;
}
}
var result;
var minLength = Number.MAX_SAFE_INTEGER;
var chars = Object.keys(letters);
for (var i = 0; i < words.length; i++) {
var word = words[i];
if (word.length >= minLength) continue;
var tempLetters = {};
for (var j = 0; j < word.length; j++) {
var char = word[j];
if (letters[char]) {
tempLetters[char] ? tempLetters[char]++ : tempLetters[char] = 1;
}
}
var isMatch = true;
for (var k = 0; k < chars.length; k++) {
var char = chars[k];
if (!tempLetters[char] || letters[char] > tempLetters[char]) {
isMatch = false;
break;
}
}
if (isMatch) {
minLength = word.length;
result = word;
}
}
return result;
};
var licensePlate = "1s3 PSt";
var words = ["step", "steps", "stripe", "stepple"]
console.log(shortestCompletingWord(licensePlate, words));
licensePlate = "1s3 456";
words = ["looks", "pest", "stew", "show"];
console.log(shortestCompletingWord(licensePlate, words));
licensePlate = "GrC8950";
words = ["measure", "other", "every", "base", "according", "level", "meeting", "none", "marriage", "rest"];
console.log(shortestCompletingWord(licensePlate, words));