-
Notifications
You must be signed in to change notification settings - Fork 4
/
Copy pathbulls-and-cows.js
81 lines (72 loc) · 1.74 KB
/
bulls-and-cows.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
/**
* @param {string} secret
* @param {string} guess
* @return {string}
*/
// Solution 1
var getHint = function (secret, guess) {
var nums_a = 0, nums_b = 0;
var hash_a = [], hash_b = [];
for (var p = 0; p < secret.length; p++) {
if (secret[p] in hash_a) {
hash_a[secret[p]]++;
} else {
hash_a[secret[p]] = 1;
}
}
// check the exactly equal situation
for (var i = 0; i < guess.length; i++) {
if (guess[i] === secret[i]) {
nums_a++;
if (hash_a[secret[i]] > 0) {
hash_a[secret[i]]--;
}
}
}
// check the rest of non-paired object
for (var ii = 0; ii < guess.length; ii++) {
if (guess[ii] !== secret[ii]) {
if (guess[ii] in hash_a && hash_a[guess[ii]] > 0) {
nums_b++;
hash_a[guess[ii]]--;
}
}
}
return nums_a + "A" + nums_b + "B";
};
// Solution 2
/**
* @param {string} secret
* @param {string} guess
* @return {string}
*/
var getHint = function (secret, guess) {
var map = [];
for (var i in secret) {
if (map[secret[i]]) {
map[secret[i]]++;
} else {
map[secret[i]] = 1;
}
}
var bull = 0, cows = 0;
// check bull first
for (var j in guess) {
if (guess[j] === secret[j]) {
bull++;
map[guess[j]]--;
// Mark the paired position
var arr = guess.split('')
arr[j] = 'x';
guess = arr.join('');
}
}
// check cows
for (j in guess) {
if (map[guess[j]] > 0) {
cows++;
map[guess[j]]--;
}
}
return bull + "A" + cows + "B";
};