function solution(S) {
let stack = [];

for (let i = 0, n = S.length; i < n; i++) {
let c = S.charAt(i);
if (c === '(') {
stack.push(c);
} else if (c === ')') {
if (stack.length === 0) {
return 0;
} else if (stack[stack.length - 1] === '(') {
stack.pop();
}
}
}

return stack.length === 0 ? 1 : 0;
}


'IT General' 카테고리의 다른 글

Codility #8-TapeEquilibrium  (0) 2018.09.18
Codility #7-Brackets  (0) 2018.08.18
Codility #3-PermMissingElem  (0) 2018.08.18
Codility #3-FrogJmp  (0) 2018.08.18
Codility #2-OddOccurrencesInArray  (0) 2018.08.18
function solution(A) {
let n = A.length + 1;
let sumAll = n * (n + 1) / 2; // sum(1..N)
let sumArray = A.reduce((prev, curr) => prev + curr, 0);

return sumAll - sumArray;
}


'IT General' 카테고리의 다른 글

Codility #7-Brackets  (0) 2018.08.18
Codility #7-Nesting  (0) 2018.08.18
Codility #3-FrogJmp  (0) 2018.08.18
Codility #2-OddOccurrencesInArray  (0) 2018.08.18
Codility #2-CyclicRotation  (0) 2018.08.18
function solution(X, Y, D) {
return Math.ceil((Y - X) / D);
}


'IT General' 카테고리의 다른 글

Codility #7-Nesting  (0) 2018.08.18
Codility #3-PermMissingElem  (0) 2018.08.18
Codility #2-OddOccurrencesInArray  (0) 2018.08.18
Codility #2-CyclicRotation  (0) 2018.08.18
Fibonacci function without recursion  (0) 2018.08.15

+ Recent posts