From 7c60dee83b436e8e8a667bf9f191beced8de4fc3 Mon Sep 17 00:00:00 2001 From: Jack Sangdahl Date: Mon, 10 Mar 2025 00:36:13 -0600 Subject: chore: move cpp and rust code to directory --- path_min_effort.cpp | 34 ---------------------------------- 1 file changed, 34 deletions(-) delete mode 100644 path_min_effort.cpp (limited to 'path_min_effort.cpp') diff --git a/path_min_effort.cpp b/path_min_effort.cpp deleted file mode 100644 index 0b93590..0000000 --- a/path_min_effort.cpp +++ /dev/null @@ -1,34 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int minimumEffortPath(vector> &heights) { - int m = heights.size(), n = heights[0].size(); - int dirs[5] = {-1, 0, 1, 0, -1}; - vector> efforts(m, vector(n, INT_MAX)); - priority_queue, vector>, - greater>> - pq; - pq.emplace(0, 0); - while (!pq.empty()) { - int effort = pq.top().first; - int x = pq.top().second / 100, y = pq.top().second % 100; - pq.pop(); - if (x == m - 1 && y == n - 1) - return effort; - if (effort >= efforts[x][y]) - continue; - efforts[x][y] = effort; - for (int i = 0; i < 4; i++) { - int nX = x + dirs[i], nY = +dirs[i + 1]; - if (nX < 0 || nX >= m || nY < 0 || nY >= n) - continue; - int nEffort = max(effort, abs(heights[x][y] - heights[nX][nY])); - pq.emplace(nEffort, nX * 100 + nY); - } - } - return -1; - } -}; - -int min() {} -- cgit v1.2.3