본문 바로가기

728x90

리트코드 파이썬 문제풀이

문돌이 존버/프로그래밍 스터디 2021. 9. 23.
(leetcode 문제 풀이) Remove Element Given an integer array nums and an integer val, remove all occurrences of val in nums in-place. The relative order of the elements may be changed. Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the array nums. More formally, if there are k elements after removing the duplicates, then the first k elements..
문돌이 존버/프로그래밍 스터디 2021. 7. 29.
(leetcode 문제 풀이) Min Stack Design a stack that supports push, pop, top, and retrieving the minimum element in constant time. Implement the MinStack class: 1. MinStack() initializes the stack object. 2. void push(val) pushes the element val onto the stack. 3. void pop() removes the element on the top of the stack. 4. int top() gets the top element of the stack. 5. int getMin() retrieves the minimum element in the stack. Co..
문돌이 존버/프로그래밍 스터디 2021. 7. 16.
(leetcode 문제 풀이) Valid Parentheses Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. An input string is valid if: 1. Open brackets must be closed by the same type of brackets. 2. Open brackets must be closed in the correct order. Example 1: Input: s = "()" Output: true Example 2: Input: s = "()[]{}" Output: true Example 3: Input: s = "(]" Output: false Example..

728x90

티스토리툴바