Solved 2 problems

Author: gyeong-hyeon-kim

level-2/괄호-변환.js

@@ -0,0 +1,63 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+//정답 1
+function solution(p) {
+    if(p.length === 0) return p
+    let bracketCount = 0
+    let isURight = true
+    for(let i=0; i<p.length; i++){
+        bracketCount = p[i] === '(' ? bracketCount + 1 : bracketCount - 1
+        if(bracketCount < 0) isURight = false
+        if(bracketCount === 0){
+            const [u, v] = [p.slice(0,i+1), p.slice(i+1)]
+            if(isURight){
+                return u + solution(v)
+            }else{
+                let emptyString = '(' + solution(v) + ')'
+                const slicedReversedString = u
+                    .slice(1,u.length-1)
+                    .split('')
+                    .map(bracket=> bracket === '(' ? ')' : '(')
+                    .join('')
+                return emptyString + slicedReversedString
+            }
+        }
+    }
+}
+
+//정답 2
+function solution(p) {
+    if(p.length === 0){
+        return p
+    }else{
+        const sliceIndex = balancedIndex(p)
+        const [u, v] = [p.slice(0,sliceIndex+1), p.slice(sliceIndex+1)]
+        if(isRight(u)){
+            return u + solution(v)
+        }else{
+            let emptyString = '(' + solution(v) + ')'
+            const slicedReversedString = u
+                .slice(1,u.length-1)
+                .split('')
+                .map(bracket=> bracket === '(' ? ')' : '(')
+                .join('')
+            return emptyString + slicedReversedString
+        }
+    }
+}
+const isRight = (str) => {
+    if(str[0] === ')') return false
+    let stack = 0
+    for(let i=0; i<str.length; i++){
+        stack = str[i] === '(' ? stack + 1 : stack - 1
+        if(stack < 0) return false
+    }
+    return stack === 0
+}
+const balancedIndex = (str) =>{
+    let count = 0
+    for(let i=0; i<str.length; i++){
+        count = str[i] === '(' ? count + 1 :  count - 1
+        if(count === 0) return i
+    }
+}

level-2/다리를-지나는-트럭.js

@@ -0,0 +1,30 @@
+//https://github.com/codeisneverodd/programmers-coding-test
+//완벽한 정답이 아닙니다.
+//정답 1
+function solution(bridge_length, weight, truck_weights) {
+    let [tick, onBridge, weightOnBridge] = [0, [{weight:0, timeToOut: 0}], 0]
+    while(onBridge.length > 0 || truck_weights.length > 0){
+        if(onBridge[0].timeToOut === tick) weightOnBridge -= onBridge.shift().weight
+        if(weightOnBridge + truck_weights[0] <= weight){
+            weightOnBridge += truck_weights[0]
+            onBridge.push({weight: truck_weights.shift(), timeToOut: tick + bridge_length})
+        }else{
+            if(onBridge[0]) tick = onBridge[0].timeToOut - 1 // 시간을 줄이는 포인트
+        }
+        tick++
+    }
+    return tick
+}
+
+//정답 2
+function solution(bridge_length, weight, truck_weights) {
+    const bridge = new Array(bridge_length).fill(0)
+    let tick = 0
+    do{
+        tick++
+        bridge.pop()
+        bridge.reduce((a,b)=>a+b) + truck_weights[0] <= weight ?
+            bridge.unshift(truck_weights.shift()) : bridge.unshift(0)
+    }while(bridge.reduce((a,b)=>a+b) !== 0)
+    return tick;
+}