k-codestudy 님의 블로그

프로그래머스 LV.5 방의 개수 미완성 #pragma once#include #include class C_ROOM{private: std::map m_mapNode; std::set m_setResult; int m_nX; int m_nY;private: long long makeId(int nX, int nY); void loadId(long long llId, int& nX, int& nY);public: C_ROOM() = default; void init(); void move(int nWay); void result();}; #include "room.h"long long C_ROOM::makeId(int nX, int nY){ return (long long)nX + (long lon..

프로그래머스 - 택배 배달과 수거하기이거 while 한번 없애보기 도전 #include int main(){ int arD[5]{ 1,0,3,1,2 }; int arP[5]{ 0,3,0,4,0 }; int nLastIndex = 4; int nCap = 4; int nDTotal{}; int nPTotal{}; for (int i = nLastIndex; i >= 0; i--) { nDTotal += arD[i]; nPTotal += arP[i]; int nCnt = 0; while (nDTotal > 0 || nPTotal > 0) { nDTotal -= nCap; nPTotal -= nCap; nCnt++; } if (nCnt > 0) printf("%d\n", i); }}

다익스트라#pragma once#include #include class C_DIJKSTRA{private: struct S_NODE { int nId; std::map child; bool bVisit; S_NODE* pParent; int nLength; bool operator()(S_NODE* Dst, S_NODE* Src) { return Dst->nLength > Src->nLength; } };private: std::map m_mapNode;private: S_NODE* findCreateNode(int nId); void p..

다익스트라 알고리즘 #pragma once#include #include class C_DIJKSTRA{private: struct S_NODE { int nId; std::map child; bool bVisit; S_NODE* pParent; int nLength; bool operator()(S_NODE* Dst, S_NODE* Src) { return Dst->nLength > Src->nLength; } //bool operator()(S_NODE& Dst, S_NODE& Src) //{ //return Dst.nLength > Src.nLength; //} };private: ..

배추, 양, 늑대, 농부 문제#pragma once#include class C_CROSS{private: enum class E_LAND { E_NONE = 0, E_VISIT, E_END }; enum { E_NONE, E_CABBAGE = 0x01, E_SHEEP = 0x02, E_WOLF = 0x04, E_FARMER = 0x08, };private: bool m_arEnable[16]; E_LAND m_arVisit[2][16];private: void cross(int nState, bool bLeft, int nDepth); void print(int nState, int nDepth);public: C_CROSS() = default; void init();..

크루스칼 알고리즘#pragma once#include #include class C_KRUSKAL{private: struct S_NODE { char c1; char c2; int nLength; bool operator()(S_NODE s1, S_NODE s2) const { return s1.nLength > s2.nLength; } };private: char m_arParent[127]{}; int m_arNode[127][127]; std::priority_queue, S_NODE> m_heap; char findParent(char c); void setParent(char c, char cParent);public: C_KRUSKAL() = default; void add(..

#pragma once#include #include class C_KRUSKAL{private: struct S_NODE { char c1; char c2; int nLength; bool operator()(S_NODE s1, S_NODE s2) const { return s1.nLength > s2.nLength; } };private: int m_arNode[127][127]; std::priority_queue, S_NODE> m_heap;public: C_KRUSKAL() = default; void add(char cDst, char cSrc, int nLenght); void print(); void run();}; #include "kruskal.h"#include voi..

#pragma once#include #include class C_ISLAND{private: struct S_NODE { int nType; std::list arChild[2]; std::list::iterator iterNodeList; // 일회성 bool bVisit; };private: static int m_arData[10][10]; S_NODE m_arNode[10][10]; std::list m_listNode; std::list*> m_listIsland[2];private: void LinkedNode(); bool findType(int nY, int nX, int *pType); void makeLand(); void nodeGroup(int nType, S_NODE* ..

#pragma once#include #include class C_ISLAND{private: struct S_NODE { int nType; std::list arChild[2]; std::list::iterator iterNodeList; };private: static int m_arData[10][10]; S_NODE m_arNode[10][10]; std::list m_listNode; //std::list* > listIsland;private: void linkNode(); bool findType(int nY, int nX, int* pType); void makeLand(); void nodeGroup(int nType , S_NODE* pNode, std::list& listGr..

#pragma once#include #include #include class C_MOUNTAIN{public: enum class E_TYPE { E_PATH = 0, E_GATE, E_SUMMIT, };private: struct S_NODE { std::set child; E_TYPE eType; }; S_NODE** m_arNode; int** m_arIntentsity{}; std::set m_setEnalbeNode; std::list m_listPath;private: S_NODE* createNode(int nId); void move(int nParent, int nId, int nIntensity);public: C_MOUNTAIN() = default; void addPat..