Class Solution
-
- All Implemented Interfaces:
public final class Solution
2140 - Solving Questions With Brainpower.
Medium
You are given a 0-indexed 2D integer array
questions
where <code>questionsi = points<sub>i</sub>, brainpower<sub>i</sub></code>.The array describes the questions of an exam, where you have to process the questions in order (i.e., starting from question
0
) and make a decision whether to solve or skip each question. Solving questioni
will earn you <code>points<sub>i</sub></code> points but you will be unable to solve each of the next <code>brainpower<sub>i</sub></code> questions. If you skip questioni
, you get to make the decision on the next question.For example, given
questions = \[\[3, 2], [4, 3], [4, 4], [2, 5]]
:
Return the maximum points you can earn for the exam.
Example 1:
Input: questions = \[\[3,2],4,3,4,4,2,5]
Output: 5
Explanation: The maximum points can be earned by solving questions 0 and 3.
Solve question 0: Earn 3 points, will be unable to solve the next 2 questions
Unable to solve questions 1 and 2
Solve question 3: Earn 2 points
Total points earned: 3 + 2 = 5. There is no other way to earn 5 or more points.
Example 2:
Input: questions = \[\[1,1],2,2,3,3,4,4,5,5]
Output: 7
Explanation: The maximum points can be earned by solving questions 1 and 4.
Skip question 0
Solve question 1: Earn 2 points, will be unable to solve the next 2 questions
Unable to solve questions 2 and 3
Solve question 4: Earn 5 points
Total points earned: 2 + 5 = 7. There is no other way to earn 7 or more points.
Constraints:
<code>1 <= questions.length <= 10<sup>5</sup></code>
questions[i].length == 2
<code>1 <= points<sub>i</sub>, brainpower<sub>i</sub><= 10<sup>5</sup></code>
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
Modifier and Type Method Description final Long
mostPoints(Array<IntArray> questions)
-
-
Method Detail
-
mostPoints
final Long mostPoints(Array<IntArray> questions)
-
-
-
-