분류 전체보기103 [leetcode] 1021.Remove Outermost Parentheses https://leetcode.com/problems/remove-outermost-parentheses/description/ Remove Outermost Parentheses - LeetCode Can you solve this real interview question? Remove Outermost Parentheses - A valid parentheses string is either empty "", "(" + A + ")", or A + B, where A and B are valid parentheses strings, and + represents string concatenation. * For example, "", "()", leetcode.com 문제 이해 '()'한쌍의 완전한.. 2023. 8. 28. [leetcode] 844.Backspace String compare https://leetcode.com/problems/backspace-string-compare/description/ Backspace String Compare - LeetCode Can you solve this real interview question? Backspace String Compare - Given two strings s and t, return true if they are equal when both are typed into empty text editors. '#' means a backspace character. Note that after backspacing an empty text, the tex leetcode.com 🧐 문제 이해 두 개의 문자열 s와 t가 주.. 2023. 8. 27. [leetcode] 155.Min Stack https://leetcode.com/problems/min-stack/description/ Min Stack - LeetCode Can you solve this real interview question? Min Stack - Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. Implement the MinStack class: * MinStack() initializes the stack object. * void push(int val) pushes t leetcode.com 문제 이해 MinStack을 디자인 Stack과 모든게 동일하지만 getMin()을 호출 시 st.. 2023. 8. 26. [leetcode] 856.Score of Parentheses(Retry) https://leetcode.com/problems/score-of-parentheses/description/ Score of Parentheses - LeetCode Can you solve this real interview question? Score of Parentheses - Given a balanced parentheses string s, return the score of the string. The score of a balanced parentheses string is based on the following rule: * "()" has score 1. * AB has score A + B, w leetcode.com 설명 String s 를 매개변수로 받고, socre를 반.. 2023. 8. 20. 이전 1 2 3 4 5 ··· 26 다음