일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- kaggle
- concurrency
- 715. Range Module
- iterator
- 컴퓨터의 구조
- 30. Substring with Concatenation of All Words
- Convert Sorted List to Binary Search Tree
- 운영체제
- Generator
- LeetCode
- Decorator
- 43. Multiply Strings
- Python Implementation
- Class
- shiba
- 시바견
- attribute
- 밴픽
- 프로그래머스
- t1
- data science
- Python
- 109. Convert Sorted List to Binary Search Tree
- 315. Count of Smaller Numbers After Self
- Substring with Concatenation of All Words
- 파이썬
- Protocol
- DWG
- Regular Expression
- Python Code
- Today
- Total
목록Computer Science/C++ (38)
Scribbling
https://leetcode.com/problems/lru-cache/description/ #include #include #include using namespace std;class Node {public: int key; int val; Node() {} Node(int key=-1, int val=-1) : key(key), val(val) {} ~Node() {}};class LRUCache {public: list ll; map::iterator> dict; int capacity; int cnt; LRUCache(int capacity) : capacity(capacity), cnt(0) {} int get(int key) { ..
#include using namespace std;class Printable { friend ostream& operator
https://leetcode.com/problems/implement-trie-prefix-tree/description/ Trie.h#pragma once#include class TrieNode{private: char ch; bool isWord; TrieNode* children[26] {nullptr};public: TrieNode(char ch, bool isWord=false); TrieNode(const TrieNode& node); TrieNode(TrieNode&& node); TrieNode& operator=(const TrieNode& rhs); TrieNode& operator=(TrieNode&& rhs); char getCh() const; bool getIsWord() ..
https://www.hackerrank.com/challenges/attribute-parser/problem?isFullScreen=true Attribute Parser | HackerRankParse the values within various tags.www.hackerrank.com #include #include #include #include #include #include #include using namespace std;int main() { /* Enter your code here. Read input from STDIN. Print output to STDOUT */ int n, q; cin >> n >> q; cin.ignore(); /..
https://www.hackerrank.com/challenges/abstract-classes-polymorphism/problem?isFullScreen=true Abstract Classes - Polymorphism | HackerRankGiven an abstract class Cache, write a class LRUCache which extends the class Cache and implement an LRU cache.www.hackerrank.com #include #include #include #include #include #include #include using namespace std;struct Node{ Node* next; Node* prev; int ..
https://www.hackerrank.com/challenges/virtual-functions/problem?isFullScreen=true Virtual Functions | HackerRankLearn how to use virtual functions and solve the given problem.www.hackerrank.com #include #include #include #include #include using namespace std;class Person {public: string name; int age; Person() {} virtual void getdata() {}; virtual void putdata() {}; virtual..
C++ Regular Expressions Libraryhttps://en.cppreference.com/w/cpp/regex Regular expressions library (since C++11) - cppreference.comRegular expressions library The regular expressions library provides a class that represents regular expressions, which are a kind of mini-language used to perform pattern matching within strings. Almost all operations with regexes can be characterized byen.cpprefere..
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(..
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..