LeetCode8 [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] 682.Baseball Game https://leetcode.com/problems/baseball-game/description/ Baseball Game - LeetCode Can you solve this real interview question? Baseball Game - You are keeping the scores for a baseball game with strange rules. At the beginning of the game, you start with an empty record. You are given a list of strings operations, where operations[i] is leetcode.com Stack을 이용 정직하게 설명되어있는 대로 구현만 하면 되는 문제 pop과 push.. 2023. 8. 19. 이전 1 2 다음