알고리즘 풀 업데이트

Author: devbit4

part1/1.세자리곱셈.txt

@@ -0,0 +1,14 @@
+let fs = require("fs")
+let input = fs.readFileSync("input.txt").toString().split("\n")
+
+const leftNumber=Number(input[0])
+
+const a= Number(input[1].split("")[2])
+const b= Number(input[1].split("")[1])
+const c= Number(input[1].split("")[0])
+
+
+console.log(leftNumber*a)
+console.log(leftNumber*b)
+console.log(leftNumber*c)
+console.log(leftNumber*a+leftNumber*b*10+leftNumber*c*100)

섹션8/9.동전교환.html

@@ -12,13 +12,12 @@
           if (sum > m) return;
 
           if (L >= answer) return;
-
           if (sum === m) {
-            // answer = Math.min(answer, L);
+            answer = Math.min(answer, L);
           } else {
-            // for (let i = 0; i < n; i++) {
-            //   DFS(L + 1, sum + arr[i]);
-            // }
+            for (let i = 0; i < n; i++) {
+              DFS(L + 1, sum + arr[i]);
+            }
           }
         }
         DFS(0, 0);