글
329. Longest Increasing Path in a Matrix
https://leetcode.com/problems/longest-increasing-path-in-a-matrix/
Longest Increasing Path in a Matrix - LeetCode
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
octave:1> A = [1, 1; 0, 1]
A =
1 1
0 1
octave:2> B = [1, 0; 1, 1]
B =
1 0
1 1의 matrix 곱 combination의 수학적 의미를 찾고 싶었는데, 실패.
https://massivealgorithms.blogspot.com/2019/03/leetcode-780-reaching-points.html
LeetCode 780 - Reaching Points
https://leetcode.com/problems/reaching-points/ A move consists of taking a point (x, y) and transforming it to either (x, x+y) or (x...
massivealgorithms.blogspot.com
'공부 > Computers' 카테고리의 다른 글
| 자동으로 챗지피티 AI 챗봇 생성 (0) | 2024.03.10 |
|---|---|
| ML engineer interview preparations (0) | 2020.10.26 |
| coursera recent deep learning courses (0) | 2020.05.04 |
| codejam 2020 R1 나중에 다시 볼 문제 기록 (0) | 2020.05.02 |
| codejam 2018 R1B R1C practice (0) | 2020.04.10 |
| kickstart 2019 Round A 공부 (0) | 2020.03.16 |
| cs231n stanford dnn image classification 보는 중 (1) | 2016.08.07 |
| SPRING FRAMEWORK ESSENTIALS video 보기 (2) | 2016.06.17 |
| videolectures로 PLSI, LDA 공부 (1) | 2016.04.18 |
| real time recommendation: Google News Personalization: Scalable Online Collaborative Filtering 논문 읽기 (0) | 2016.04.01 |
RECENT COMMENT