Notice
Recent Posts
Recent Comments
Link
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
Tags
- C
- 동적라이브러리
- Frenet Coordinate
- solver
- 경로생성
- 공유라이브러리
- CUDA
- GNN
- 백준
- Dubins Path
- C++
- Recursion
- Graph Neural Network
- OSQP
- 강화학습
- Motion Planning
- autonomous vehicle
- self driving car
- 선형대수
- 소프티어
- 수치최적화
- 정적라이브러리
- Hybrid A star
- CPP
- Leetcode
- GIT
- MDP
- PathPlanning
- DynamicProgramming
- path planning
Archives
- Today
- Total
목록Leetcode (18)
Swimmer
[LeetCode] 876. Middle of the Linked List, C
Idea When we need to find median value, index -> we can use this algorithms move two step forward agent, move onstep forward agent per scenario. /** * Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */ struct ListNode* middleNode(struct ListNode* head){ struct ListNode* first = head; struct ListNode* second = head; while(first && first->next) { sec..
코딩 문제
2022. 12. 28. 15:55
[LeetCode] 1342 Number of Steps to Reduce a Number to Zero, C
Solution Simple sequential calculation Other Solution can use binary operation int numberOfSteps(int num) { int step = 0; while (num != 0) { if (num % 2 == 0) { num = num / 2; } else { num -= 1; } ++step; } return step; }
코딩 문제
2022. 12. 28. 08:54