leetcode

Solution to some Leetcode problems written in C++

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

2140.cpp (459B)

0 class Solution { 1 static const int size = 1E5 + 1; 2 long long dp[size]; 3 4 public: 5 Solution() { memset(dp, 0xFF, sizeof(dp)); } 6 7 long long mostPoints(const vector<vector<int>> &questions, int i = 0) { 8 if (i >= questions.size()) return 0; 9 if (dp[i] != -1) return dp[i]; 10 return dp[i] = max(questions[i][0] + mostPoints(questions, i + questions[i][1] + 1), 11 mostPoints(questions, i + 1)); 12 } 13 };