Skip to content

Commit 1838765

Browse files
authored
feat: update ts solution to lcci problem: No.16.15 (#2612)
1 parent 0e9586f commit 1838765

File tree

3 files changed

+12
-12
lines changed

3 files changed

+12
-12
lines changed

lcci/16.15.Master Mind/README.md

+4-4
Original file line numberDiff line numberDiff line change
@@ -108,16 +108,16 @@ var masterMind = function (solution, guess) {
108108
let counts2 = { R: 0, G: 0, B: 0, Y: 0 };
109109
let res1 = 0;
110110
for (let i = 0; i < solution.length; i++) {
111-
let s1 = solution.charAt(i),
112-
s2 = guess.charAt(i);
113-
if (s1 == s2) {
111+
let s1 = solution[i],
112+
s2 = guess[i];
113+
if (s1 === s2) {
114114
res1++;
115115
} else {
116116
counts1[s1] += 1;
117117
counts2[s2] += 1;
118118
}
119119
}
120-
let res2 = ['R', 'G', 'B', 'Y'].reduce((a, c) => a + Math.min(counts1[c], counts2[c]), 0);
120+
let res2 = Object.keys(counts1).reduce((a, c) => a + Math.min(counts1[c], counts2[c]), 0);
121121
return [res1, res2];
122122
};
123123
```

lcci/16.15.Master Mind/README_EN.md

+4-4
Original file line numberDiff line numberDiff line change
@@ -115,16 +115,16 @@ var masterMind = function (solution, guess) {
115115
let counts2 = { R: 0, G: 0, B: 0, Y: 0 };
116116
let res1 = 0;
117117
for (let i = 0; i < solution.length; i++) {
118-
let s1 = solution.charAt(i),
119-
s2 = guess.charAt(i);
120-
if (s1 == s2) {
118+
let s1 = solution[i],
119+
s2 = guess[i];
120+
if (s1 === s2) {
121121
res1++;
122122
} else {
123123
counts1[s1] += 1;
124124
counts2[s2] += 1;
125125
}
126126
}
127-
let res2 = ['R', 'G', 'B', 'Y'].reduce((a, c) => a + Math.min(counts1[c], counts2[c]), 0);
127+
let res2 = Object.keys(counts1).reduce((a, c) => a + Math.min(counts1[c], counts2[c]), 0);
128128
return [res1, res2];
129129
};
130130
```

lcci/16.15.Master Mind/Solution.js

+4-4
Original file line numberDiff line numberDiff line change
@@ -8,15 +8,15 @@ var masterMind = function (solution, guess) {
88
let counts2 = { R: 0, G: 0, B: 0, Y: 0 };
99
let res1 = 0;
1010
for (let i = 0; i < solution.length; i++) {
11-
let s1 = solution.charAt(i),
12-
s2 = guess.charAt(i);
13-
if (s1 == s2) {
11+
let s1 = solution[i],
12+
s2 = guess[i];
13+
if (s1 === s2) {
1414
res1++;
1515
} else {
1616
counts1[s1] += 1;
1717
counts2[s2] += 1;
1818
}
1919
}
20-
let res2 = ['R', 'G', 'B', 'Y'].reduce((a, c) => a + Math.min(counts1[c], counts2[c]), 0);
20+
let res2 = Object.keys(counts1).reduce((a, c) => a + Math.min(counts1[c], counts2[c]), 0);
2121
return [res1, res2];
2222
};

0 commit comments

Comments
 (0)