일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- C++
- 강화학습
- 선형대수
- self driving car
- 동적라이브러리
- 정적라이브러리
- 소프티어
- CUDA
- GNN
- Dubins Path
- GIT
- Graph Neural Network
- Frenet Coordinate
- MDP
- DynamicProgramming
- 경로생성
- Motion Planning
- OSQP
- PathPlanning
- path planning
- autonomous vehicle
- Hybrid A star
- CPP
- 수치최적화
- C
- solver
- 백준
- Recursion
- 공유라이브러리
- Leetcode
- Today
- Total
목록C++ (8)
Swimmer
Solution - Use Bitwise operator class Solution { public: bool isPowerOfTwo(int n) { if (n < 0) { return false; } else { return n && !(n & n - 1); } } };
std::unordered_map This data structure is an associative container the contains key-value pairs with unique keys. Search, insertion, and removal of elements have average constane-time complexity Internally, the elements are not osorte in any particular order, but organized into buckets. Properties Associative container Unique keys Reference : https://en.cppreference.com/w/cpp/container/unordered..
std::map Maps are associative containers that store elements formed by a combination of a key value and mapped value. The key values are generally used to sort and uniquely identify the elements The mapped values store the content associated to this key. The types of key and mapped value may differ. and both are grouped together by pair type typedef pair value_type; Internally, the elements in a..
Solution Use Queue First time to use C++ STL, it is very useful than coding data structure one by one in C #include #include // BFS Solution // Use Queue // Use STL -> Easy typedef struct myStruct { int RowIdx; int ColumnIdx; int depth; }myStruct; using namespace std; void BFS(int row, int column, queue* pmy_queue, vector* pmyvector); int gArr[100][100] = { 0 }; int main() { queue my_queue; vect..