leetcode) #20) Valid Parentheses
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 스택사용 ool isValid(string s) { stack st; int len = s.size(); st.push(s[0]); for(int i = 1; i < len; i++) { // if it's closing if(s[i] == ')') { if(st.empty() || st.top() != '(..
PS
2021. 2. 22. 18:06
공지사항
최근에 올라온 글
최근에 달린 댓글
- Total
- Today
- Yesterday
링크
TAG
- permutation
- graph
- MVC
- binary search
- db
- Tree
- Stack
- Python
- floyd warshall
- Unity
- 조합
- Dijkstra
- 자료구조
- C++
- 이분탐색
- Brute Force
- Implementation
- Spring
- dfs
- recursion
- DP
- BFS
- CSS
- greedy
- 재귀
- Kruskal
- two pointer
- C
- back tracking
- priority queue
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
글 보관함