Search

Get Maximum in Generated Array

You are given an integer n. An array nums of length n + 1 is generated in the following way:

  • nums[0] = 0

  • nums[1] = 1

  • nums[2 * i] = nums[i] when 2 <= 2 * i <= n

  • nums[2 * i + 1] = nums[i] + nums[i + 1] when 2 <= 2 * i + 1 <= n

Return the maximum integer in the array nums​​​.

Example 1:


Input: n = 7 
Output: 3 
Explanation: 
According to the given rules:   nums[0] = 0   
nums[1] = 1   
nums[(1 * 2) = 2] = nums[1] = 1   
nums[(1 * 2) + 1 = 3] = nums[1] + nums[2] = 1 + 1 = 2   
nums[(2 * 2) = 4] = nums[2] = 1   
nums[(2 * 2) + 1 = 5] = nums[2] + nums[3] = 1 + 2 = 3   
nums[(3 * 2) = 6] = nums[3] = 2   
nums[(3 * 2) + 1 = 7] = nums[3] + nums[4] = 2 + 1 = 3 

Hence, nums = [0,1,1,2,1,3,2,3], and the maximum is 3. 

Example 2:

Input: n = 2 
Output: 1 
Explanation: According to the given rules, the maximum between nums[0], nums[1], and nums[2] is 1. 

Example 3:

Input: n = 3 
Output: 2 
Explanation: According to the given rules, the maximum between nums[0], nums[1], nums[2], and nums[3] is 2. 

Constraints:

  • 0 <= n <= 100

Solution:

class Solution {
    public int getMaximumGenerated(int n) {
        int[] nums=new int[n+1];
        int max=0;
        nums[0]=0;
        if(n==0 || n==1)
            return n;
        nums[1]=1;
        
        for(int i=2;i<=n;i++)
        {
            if(i%2==0)
            {
               nums[i]=nums[i/2]; 
            }
            else
                nums[i]=nums[i/2]+nums[i/2+1];
                max=Math.max(max,nums[i]);   
        }
        
        return max;
    }
}

13 views0 comments

Recent Posts

See All

A string s is called good if there are no two different characters in s that have the same frequency. Given a string s, return the minimum number of characters you need to delete to make s good. The f

The numeric value of a lowercase character is defined as its position (1-indexed) in the alphabet, so the numeric value of a is 1, the numeric value of b is 2, the numeric value of c is 3, and so on.