-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path03_FrogJumpII.cpp
99 lines (93 loc) · 2.07 KB
/
03_FrogJumpII.cpp
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
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
// FrogJump III
#include <bits/stdc++.h>
using namespace std;
class Solution2
{
// Tabulation
public:
int frogJump(int n, vector<int> &heights, int k)
{
vector<int> dp(n);
for (int i = 1; i < n; ++i)
{
int subMin = INT_MAX;
for (int j = 1; j <= k; ++j)
{
int f = INT_MAX;
if (i >= j) {
f = dp[i-j] + abs(heights[i]-heights[i-j]);
}
subMin = min(f, subMin);
}
dp[i] = subMin;
}
return dp[n-1];
}
};
class Solution1
{
// Memoization (Top down)
public:
int frogJump(int n, vector<int> &heights, int k)
{
vector<int> dp(n, -1);
return dp[n-1] = solve(n - 1, heights, k, dp);
}
int solve(int n, vector<int> &heights, int &k, vector<int> &dp)
{
if (n == 0)
{
return 0;
}
if (dp[n] != -1) {
return dp[n];
}
int subMin = INT_MAX;
for (int i = 1; i <= k; ++i)
{
int f = INT_MAX;
if (n >= i)
{
f = solve(n - i, heights, k, dp) + abs(heights[n] - heights[n - i]);
}
subMin = min(subMin, f);
}
return dp[n] = subMin;
}
};
class Solution
{
// Simple recursion
public:
int frogJump(int n, vector<int> &heights, int k)
{
return solve(n - 1, heights, k);
}
int solve(int n, vector<int> &heights, int &k)
{
if (n == 0)
{
return 0;
}
int subMin = INT_MAX;
for (int i = 1; i <= k; ++i)
{
int f = INT_MAX;
if (n >= i)
{
f = solve(n - i, heights, k) + abs(heights[n] - heights[n - i]);
}
subMin = min(subMin, f);
}
return subMin;
}
};
int main()
{
vector<int> heights = {10, 20, 30, 10};
Solution2 Obj1;
cout << Obj1.frogJump(4, heights, 2);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
return 0;
}