• Disk Space Analysis

• AM

  Movie Ratings

• Coding 2

Start Video

• anju

• Mrunal Pagnis

Movie Ratings

Description

Alex loves movies and maintains a list of negative and/or positive integer ratings for the movies in a collection. Alex is getting ready for a film festival and wants to choose some subsequence of movies from the collection to bring such that the following conditions are satisfied:

• The collective sum of their ratings is maximal.
• Alex must go through the list in order and cannot skip more than one movie in a row. In other words, Alex cannot skip over two or more consecutive movies. For example, if ratings = [-1, -3, -2], and must include either the second number or the first and third numbers to get a maximal rating sum of -3.

Example

ratings = [-3, 2, 4, -1, -2, -5].

The maximal choices are [2, 4, -2] for a sum of 4.

Function Description

Complete the function maximizeRatings in the editor below.

maximizeRatings has the following parameter(s):

    int ratings[n]:  movie ratings

Returns

    int: the maximum possible rating sum for a subsequence of movies

Constraints

• 1 ≤ n ≤ 105
• -1000 ≤ ratings[i] ≤ 1000, where 0 ≤ i < n

Input Format for Custom Testing

Sample Case 0

Sample Input 0

STDIN    Function -----    -------- 5        ratings[] size n = 5 9        ratings = [9, -1, -3, 4, 5] -1 -3 4 5

Sample Output 0

17

Explanation 0

Alex picks the bolded items in ratings = [9, -1, -3, 4, 5] to get maximum rating = 9 + -1 + 4 + 5 = 17. Sample Case 1

Java 8

1

12

13

14

19

20

15

18

16

17

21

22

23

24

27

38

39

40

25

26

28

35

37

36

29

30

34

41

31

32

33

42

import java.io.*;

    // Complete the maximizeRatings function below.

    static int maximizeRatings(int[] ratings) {

    }

        return fun(ratings, ratings.length-1, Integer.MIN_VALUE);

    static int fun(int[] ratings, int index, int max) {

        if(index  >=  ratings.length){

    }

            return max;

        }

        for(int i=ratings.length-1; i>0;i—){

        return max;

        }

            if(index>1){

                  int pick = fun(ratings, index-1, max+ratings[index]);

            }

            int notPick = fun(ratings, index-1, max+0);

                        max = Math.max(pick, notPick);

    private static final Scanner scanner = new Scanner(System.in);

Line: 22 Col: 16

Run CodeRun Tests

Input / Output

Test Cases

Compilation successful. You can Run Test Cases now.

Input

Your Output (stdout)

• 2147483647

int a, Returns the greater of two int values. That is, the result is the argument closer to the value of Integer.MAX_VALUE. If the arguments have the same value, the result is that same value. * Parameters: - a an argument. - b another argument. * Returns: - the larger of a and b., hint