15일 - 생성된 배열에서 최대값 얻기

문제

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

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.

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

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.

내 테스트

import pytest
from .Day14_GetMaximumInGeneratedArray import Solution

s = Solution()


@pytest.mark.parametrize(
    "n,expected",
    [
        (7, 3),
        (2, 1),
        (3, 2),
        (0, 0),
    ],
)
def test_get_maximum_generated(n, expected):
    assert s.getMaximumGenerated(n) == expected

내 솔루션

class Solution:
    def getMaximumGenerated(self, n: int) -> int:
        l = n + 1
        if n == 0:
            return 0
        nums = [0] * l
        nums[1] = 1
        current_max = 1

        for i in range(1, l):
            x = 2 * i
            if x > 1 and x <= n:
                nums[x] = nums[i]
            if x + 1 > 1 and x + 1 <= n:
                nums[x + 1] = nums[i] + nums[i + 1]
            current_max = max(current_max, nums[i])

        return current_max

분석

내 해설