일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- Python Implementation
- Decorator
- data science
- Class
- Regular Expression
- iterator
- shiba
- 프로그래머스
- Convert Sorted List to Binary Search Tree
- 파이썬
- Python Code
- Substring with Concatenation of All Words
- 운영체제
- t1
- Protocol
- Python
- DWG
- 밴픽
- 315. Count of Smaller Numbers After Self
- 컴퓨터의 구조
- 시바견
- Generator
- attribute
- 109. Convert Sorted List to Binary Search Tree
- 715. Range Module
- kaggle
- 30. Substring with Concatenation of All Words
- LeetCode
- concurrency
- 43. Multiply Strings
- Today
- Total
목록2024/02 (6)
Scribbling
https://leetcode.com/problems/merge-k-sorted-lists/description/ LeetCode - The World's Leading Online Programming Learning Platform 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 using namespace std; struct ListNode { int val; ListNode *next; ListNode() : val(0), next(nullptr) {} ListNode(..
https://leetcode.com/problems/least-number-of-unique-integers-after-k-removals/?envType=daily-question&envId=2024-02-16 class Solution { public int findLeastNumOfUniqueInts(int[] arr, int k) { Map counter = new HashMap(); for (int num : arr) { counter.merge(num, 1, Integer::sum); } List list = new ArrayList(); for (Integer key : counter.keySet()) { Integer val = counter.get(key); List tmp = new ..
using namespace std; class Shape { public: virtual void roar() = 0; virtual ~Shape() {}; }; class I_Shape { public: friend ostream &operator
https://leetcode.com/problems/longest-increasing-subsequence/ LeetCode - The World's Leading Online Programming Learning Platform 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 class Solution { public: int lengthOfLIS(vector& nums) { vector tmp; for (int num : nums) { auto it = lower_bound..
https://leetcode.com/problems/sliding-window-maximum/ class Solution { public: vector maxSlidingWindow(vector& nums, int k) { vector ret; deque q; for(int i=0; i= k - 1) { ret.push_back(nums[q[0]]); } } return ret; } };
https://leetcode.com/problems/meeting-rooms-ii/description/ LeetCode - The World's Leading Online Programming Learning Platform 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 class Solution { public: int minMeetingRooms(vector& intervals) { sort(intervals.begin(), intervals.end()); priorit..