leetcode

Solution to some Leetcode problems written in C++

git clone git://git.dimitrijedobrota.com/leetcode.git

1824.cpp (751B)

0 class Solution { 1 public: 2 int minSideJumps(const vector<int> &obstacles) const { 3 static unsigned dp[500002][3]; 4 const int n = size(obstacles); 5 6 memset(dp, 0xF0, sizeof(dp)); 7 memset(dp[n - 1], 0x00, sizeof(dp[n])); 8 for (int i = n - 2; i >= 0; i--) { 9 for (int j = 0; j < 3; j++) { 10 if (obstacles[i + 1] == j + 1) continue; 11 if (obstacles[i] == j + 1) continue; 12 dp[i][j] = dp[i + 1][j]; 13 } 14 15 dp[i][0] = min({dp[i][0], dp[i][1] + 1, dp[i][2] + 1}); 16 dp[i][1] = min({dp[i][1], dp[i][0] + 1, dp[i][2] + 1}); 17 dp[i][2] = min({dp[i][2], dp[i][0] + 1, dp[i][1] + 1}); 18 } 19 20 return dp[0][1]; 21 } 22 };