当前位置:网站首页>Leetcode 5561. Get the maximum value in the generated array

Leetcode 5561. Get the maximum value in the generated array

2020-11-10 10:41:14 Oc'u bj12kvua

1. subject

Give you an integer n . According to the following rules to generate a length of n + 1 Array of nums :

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

Returns the generated array nums Medium Maximum value .

 Example  1
 Input :n = 7
 Output :3
 explain : According to 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
 therefore ,nums = [0,1,1,2,1,3,2,3], Maximum  3

 Example  2
 Input :n = 2
 Output :1
 explain : According to rules ,nums[0]、nums[1]  and  nums[2]  The maximum of these is  1

 Example  3
 Input :n = 3
 Output :2
 explain : According to rules ,nums[0]、nums[1]、nums[2]  and  nums[3]  The maximum of these is  2
 
 Tips :
0 <= n <= 100

source : Power button (LeetCode)
link :https://leetcode-cn.com/problems/get-maximum-in-generated-array
Copyright belongs to the network . For commercial reprint, please contact the official authority , Non-commercial reprint please indicate the source .

2. Problem solving

class Solution {
   
   
public:
    int getMaximumGenerated(int n) {
   
   
        if(n <= 1) return n;
        vector<int> arr(n+1);
        arr[0] = 0;
        arr[1] = 1;
        int ans = 0;
        for(int i = 1; i <= n; i++)
        {
   
   
            if(2*i >= 2 && 2*i <= n)
            {
   
   
                arr[2*i] = arr[i];
                ans = max(ans, max(arr[i], arr[2*i]));
            }
            if(2*i+1 >= 2 && 2*i+1 <= n)
            {
   
   
                arr[2*i+1] = arr[i]+arr[i+1];
                ans = max(ans, max(arr[i], arr[2*i+1]));
            }
            else
                break;
        }
        return ans;
    }
};

0 ms 6.7 MB


my CSDN Blog address https://michael.blog.csdn.net/

Long click or sweep code pay attention to my official account (Michael amin ), Come on together 、 Learn together !
Michael amin

版权声明
本文为[Oc'u bj12kvua]所创,转载请带上原文链接,感谢