The Problem
You are given an integer
n. An arraynumsof lengthn + 1is generated in the following way:
nums[0] = 0nums[1] = 1nums[2 * i] = nums[I]when2 <= 2 * i <= nnums[2 * i + 1] = nums[i] + nums[i + 1]when2 <= 2 * i + 1 <= n
Return the maximum integer in the arraynums.
Example 1:
Input: n = 7Output: 3Explanation: 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 = 3Hence, nums = [0,1,1,2,1,3,2,3], and the maximum is 3.Example 2:
Input: n = 2Output: 1Explanation: According to the given rules, the maximum between nums[0], nums[1], and nums[2] is 1.Example 3:
Input: n = 3Output: 2Explanation: According to the given rules, the maximum between nums[0], nums[1], nums[2], and nums[3] is 2.Constraints:
0 <= n <= 100
My Tests
importpytestfrom.Day14_GetMaximumInGeneratedArrayimportSolutions=Solution()@pytest.mark.parametrize("n,expected",[(7,3),(2,1),(3,2),(0,0),],)deftest_get_maximum_generated(n,expected):asserts.getMaximumGenerated(n)==expectedMy Solution
classSolution:defgetMaximumGenerated(self,n:int)->int:l=n+1ifn==0:return0nums=[0]*lnums[1]=1current_max=1foriinrange(1,l):x=2*iifx>1andx<=n:nums[x]=nums[i]ifx+1>1andx+1<=n:nums[x+1]=nums[i]+nums[i+1]current_max=max(current_max,nums[i])returncurrent_maxAnalysis
My Commentary
This one was probably the easiest yet. I just followed the instructions in the description. I am sure there's a lot of optimisation I could have done but leaving this one here for today.
Top comments(0)
Subscribe
For further actions, you may consider blocking this person and/orreporting abuse
