forked from AnasImloul/Leetcode-Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathReconstruct Original Digits from English.js
118 lines (86 loc) · 2.67 KB
/
Reconstruct Original Digits from English.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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
/**
* @param {string} s
* @return {string}
*/
var originalDigits = function(s) {
const numberToWord = {
0: 'zero',
1: 'one',
2: 'two',
3: 'three',
4: 'four',
5: 'five',
6: 'six',
7: 'seven',
8: 'eight',
9: 'nine'
}
const letterToDigits = {}
for(const key in numberToWord) {
const currWord = numberToWord[key]
for(const letter of currWord) {
if(!(letter in letterToDigits)) letterToDigits[letter] = new Set()
letterToDigits[letter].add(key)
}
}
const inputFreqs = {}
for(let i = 0; i < s.length; i++) {
const currChar = s[i]
if(!(currChar in inputFreqs)) inputFreqs[currChar] = 0
inputFreqs[currChar]++
}
const letters = Object.keys(inputFreqs)
const res = dfs(letters[0])
return [...res].sort().join('')
function dfs(currLetter) {
if(!isValid(inputFreqs)) return null
if(getTotalRemaining(inputFreqs) === 0) return []
const possibleDigits = letterToDigits[currLetter]
for(const digit of [...possibleDigits]) {
const wordRepresentation = numberToWord[digit]
subtract(wordRepresentation)
if(!isValid(inputFreqs)) {
addBack(wordRepresentation)
continue
}
const nextLetter = getNext(inputFreqs)
const nextDigits = dfs(nextLetter)
if(nextDigits !== null) return [digit] + nextDigits
addBack(wordRepresentation)
}
return null
}
function isValid(inputFreqs) {
for(const key in inputFreqs) {
const count = inputFreqs[key]
if(count < 0) return false
}
return true
}
function getTotalRemaining(inputFreqs) {
let sum = 0
for(const key in inputFreqs) {
const count = inputFreqs[key]
sum += count
}
return sum
}
function subtract(word) {
for(const char of word) {
if(!(char in inputFreqs)) inputFreqs[char] = 0
inputFreqs[char]--
}
}
function addBack(word) {
for(const char of word) {
inputFreqs[char]++
}
}
function getNext(inputFreqs) {
for(const key in inputFreqs) {
const count = inputFreqs[key]
if(count > 0) return key
}
return null
}
};