Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 7a81e4f

Browse files
Add 220411 짝지어-제거하기.js 1개의 풀이 추가
1 parent aa8db35 commit 7a81e4f

File tree

1 file changed

+21
-0
lines changed

1 file changed

+21
-0
lines changed

‎level-2/짝지어-제거하기.js‎

Lines changed: 21 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -24,3 +24,24 @@ function solution(s) {
2424
answer = notPairStack.length === 0 ? 1 : 0
2525
return answer;
2626
}
27+
28+
//정답 3 - jaewon1676
29+
30+
function solution(s){
31+
let cnt = 0; // 빼준 부분을 카운트 해줍니다
32+
let answer;
33+
let stack = []
34+
for (let i of s){
35+
if (stack[stack.length - 1] === i){ // 스택의 끝부분과 i를 비교합니다
36+
stack.pop();
37+
cnt++;;
38+
} else {
39+
stack.push(i)
40+
}
41+
}
42+
43+
(s.length / 2 == cnt ? answer = 1 : answer = 0 )
44+
// s의 길이를 2로 나눠서 cnt 값이 된다면 문자열의 개수만큼 잘 잘라졌다는 뜻입니다
45+
return answer;
46+
}
47+
// 코테 1주차 5번 문제와 유사합니다. 문자열 유형을 연습하기에 좋은 문제입니다

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /