We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent aaa971f commit 259a2bdCopy full SHA for 259a2bd
2 files changed
.gitignore
@@ -6,4 +6,6 @@ output.txt
6
main
7
main.cpp
8
9
-.idea
+.idea
10
+
11
+ALGORITHMS/**/*.md
ALGORITHMS/생명보험.js
@@ -0,0 +1,31 @@
1
+function solution(table) {
2
+ const list = table.map((t) =>
3
+ parseInt(
4
+ Array.from(t)
5
+ .map((x) => (x === "X" ? 0 : 1))
+ .join("")
+ .toString(2),
+ 2
+ )
+ );
12
+ let result = 8;
13
+ const des = Math.pow(2, table[0].length) - 1;
14
+ const dfs = (list, acc, dep) => {
15
+ if (dep > result) return;
16
+ if (acc === des && dep < result) {
17
+ result = dep;
18
+ return;
19
+ }
20
21
+ list.forEach((l, i) => {
22
+ const temp = list.slice();
23
+ temp.splice(i, 1);
24
+ dfs(temp, acc | l, dep + 1);
25
+ });
26
+ };
27
28
+ dfs(list, 0, 0);
29
30
+ return result;
31
+}
0 commit comments