[Leetcode 1631] Youngsang Solution #14

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Open

youngsangsuh wants to merge 2 commits into main from 1631/ysuh

youngsangsuh commented May 27, 2023

Link

Path With Minimum Effort

Topic

Dijkstra
Priority Queue

Approach

We define possible direction in each cell (left, right, up, down)
Using relaxation and maximum effort, run dijkstra

Note

Terminating when arrived at ROW-1, COL-1 idx remarkably shrinks the computation time.

youngsangsuh and others added 2 commits

May 26, 2023 17:33


          Create solution.cpp

bc4b8f2


          Add README.md file

19a5be9

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet