[Leetcode] Jump Game II

//大数据集 超时动态规划做法
class Solution {
public:
int jump(int a[], int n) {
// Start typing your C/C++ solution below
// DO NOT write int main() function
if (!n) return 0;

int* buf = new int
;

buf[0] = 0;
for (int i = 1; i < n; ++i)
buf[i] = 1 << 10;

for (int i = 1; i < n; ++i)
{
for (int j = 0; j < i; ++j)
{
if (a[j] + j >= i)
{
buf[i] = min(buf[j] + 1, buf[i]);
}
}
}

return buf[n - 1];
}
};