일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | ||
6 | 7 | 8 | 9 | 10 | 11 | 12 |
13 | 14 | 15 | 16 | 17 | 18 | 19 |
20 | 21 | 22 | 23 | 24 | 25 | 26 |
27 | 28 | 29 | 30 | 31 |
Tags
- vue.js
- git
- generic
- JavaScript
- leetcode
- loop
- 앙상블
- security
- Python
- condition
- BOJ
- docker
- npm
- VUE
- webpack
- Clone
- property
- 보안
- machine learning
- vuetify
- dotenv
- C#
- scss
- bash
- TypeScript
- nginx
- var
- C++
- type
- AI
Archives
- Today
- Total
ice rabbit programming
[LeetCode] Valid Parenthese 본문
728x90
https://leetcode.com/problems/valid-parentheses/
Valid Parentheses - LeetCode
Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview.
leetcode.com
괄호가 유효한지 검사하는 전형적인 stack 문제이다.
class Solution {
public:
bool isValid(string s) {
stack<char>* sc = new stack<char>();
for(int i=0;i<s.length();i++) {
switch(s[i]) {
case '(':
sc->push(s[i]);
break;
case '{':
sc->push(s[i]);
break;
case '[':
sc->push(s[i]);
break;
case ')':
if(sc->size()<1)
return false;
if(sc->top()=='(') {
sc->pop();
break;
}
else
return false;
case '}':
if(sc->size()<1)
return false;
if(sc->top()=='{') {
sc->pop();
break;
}
else
return false;
case ']':
if(sc->size()<1)
return false;
if(sc->top()=='[') {
sc->pop();
break;
}
else
return false;
}
}
if(sc->size()>0)
return false;
return true;
}
};
728x90
'PS > LeetCode' 카테고리의 다른 글
[LeetCode] Climbing Stairs (0) | 2020.04.15 |
---|---|
[LeetCode] Maximum Subarray (0) | 2020.04.15 |
[LeetCode] Longest Common Prefix (0) | 2020.04.15 |
[LeetCode] Remove Element (0) | 2020.04.15 |
[LeetCode] Remove Duplicates From Sorted Array (0) | 2020.04.15 |