분류 전체보기49 [백준 9934] 완전 이진 트리 문제링크 #include #include std::vector vector[10] = { }; int arr[1024]; void f(int depth, int start, int end) { if (start >= end) { return; } int mid = (start + end) / 2; vector[depth].push_back(arr[mid]); f(depth + 1, start, mid); f(depth + 1, mid + 1, end); } int main() { int k = 0; std::cin >> k; ++k; int i = 0; for (; i > arr[i]; } f(0, 0, i); for (int i = 0; i < k; ++i) { .. 2023. 3. 1. map 구현 template class Pair { public: Pair(T& t, U& u) : frist(t) , second(u) { } Pair() : frist{} , second{} { } public: T frist; U second; }; template Pair Make_Pair(T& t, U& u) { return Pair{t, u}; } template class Map { public: Map() : RootNode(nullptr) { } ~Map() { PostOrderDelete(RootNode); } private: class Node { friend Map; Pair CurPair; Node* Parent = nullptr; Node* Left = nullptr; Node* Right .. 2023. 2. 27. [프로그래머스] 컨트롤 제트 문제링크 #include #include #include using namespace std; int solution(string s) { int answer = 0; stringstream ss(""); ss.str(s); stack numbers = {}; while (false == ss.eof()) { string str = {}; ss >> str; if ("Z" == str) { answer -= numbers.top(); continue; } int num = stoi(str); numbers.push(num); answer += num; } return answer; } 2023. 2. 26. 퀵 정렬 #include #include template class DataManager { public: DataManager() {}; DataManager(size_t _Size) { Datas.resize(_Size); }; ~DataManager() {}; void Swap(T& _Left, T& _Right) { T Temp(_Left); _Left = _Right; _Right = Temp; } size_t Partition(size_t _Left, size_t _Right) { T Pivot = Datas[_Left]; size_t Low = _Left; size_t High = _Right; while (Low < High) { while (Pivot < Datas[High]) { --High; .. 2023. 2. 26. 버블 정렬 #include #include template class DataManager { public: DataManager() {}; DataManager(size_t _Size) { Datas.resize(_Size); }; ~DataManager() {}; void Swap(T& _Left, T& _Right) { T Temp(_Left); _Left = _Right; _Right = Temp; } bool Compare(const T& _Left, const T& _Right) { return _Left < _Right; } void BubbleSort() { size_t Size = Datas.size(); for (size_t i = 0; i < Size - 1; ++i) { for (size_t .. 2023. 2. 25. Array, Vector 구현 #include #include #include using namespace std; template class Array { T* Array_; size_t Size_; public: Array() : Array_(nullptr) , Size_(S) { Array_ = new T[Size_]; } ~Array() { delete[] Array_; Array_ = nullptr; } size_t Capacity() { return Size_; } void Resize(size_t _Size) { T* Temp = Array_; Array_ = new T[_Size]; for (size_t i = 0; i < _Size; i++) { Array_[i] = Temp[i]; } if (nullptr != Te.. 2023. 2. 20. 이전 1 ··· 4 5 6 7 8 9 다음