bfs 업데이트

Author: devbit4

part8/4.4연산.txt

@@ -0,0 +1,60 @@
+const fs = require("fs")
+let input = fs.readFileSync("index.txt").toString().split("\n")
+
+class Queue {
+  constructor() {
+    this._arr = []
+  }
+  enqueue(item) {
+    this._arr.push(item)
+  }
+  dequeue() {
+    return this._arr.shift()
+  }
+  getLength() {
+    return this._arr.length
+  }
+}
+
+
+let [s, t] = input[0].split(" ").map(Number)
+
+
+let queue=new Queue();
+
+queue.enqueue([s,""]);
+
+let visited=new Set([s]);
+let found=false;
+
+if(s==t){
+  return console.log(0)
+}
+
+while(queue.getLength() !=0){
+  let [value,opers]=queue.dequeue();
+  
+  if(value>1e9){
+    continue;
+  }
+
+  if(value==t){
+    found=true;
+    return console.log(opers)
+  }
+  for(let oper of ["*","+","-","/"]){
+    let nextValue=value;
+    if(oper=="*") nextValue*=value;
+    if(oper=="+") nextValue+=value;
+    if(oper=="-") nextValue-=value;
+    if(oper=="/"&&value !=0) nextValue=1;
+    if(!visited.has(nextValue)){
+      queue.enqueue([nextValue,opers+oper])
+      visited.add(nextValue)
+    }
+    
+  }
+  
+}
+
+if(!found)console.log(-1)