2023.05.12 Today's Challenge

https://leetcode.com/problems/solving-questions-with-brainpower/

Solving Questions With Brainpower - LeetCode

전형적인 DP 문제.
이제 한동안 DP만 나오려나

class Solution:
    def mostPoints(self, questions: List[List[int]]) -> int:
        n = len(questions)
        dp = [0] * n
        dp[-1] = questions[-1][0]

        for i in range(n-2, -1, -1):
            dp[i] = questions[i][0]
            skip = questions[i][1]

            if i + skip + 1 < n:
                dp[i] += dp[i+skip+1]
            
            dp[i] = max(dp[i], dp[i+1])
        
        return dp[0]