Optimal Division — LeetCode 553 Python Solution

The problem

You are given an integer array nums. The adjacent integers in nums will perform the float division.

Example

Input

nums = [1000,100,10,2]

Output

"1000/(100/10/2)"

Explanation

1000/(100/10/2) = 1000/((100/10)/2) = 200

Python solution

class Solution:
    def optimalDivision(self, nums: List[int]) -> str:
        n = len(nums)
        if n == 1:
            return str(nums[0])
        if n == 2:
            return f'{nums[0]}/{nums[1]}'
        return f'{nums[0]}/({"/".join(map(str, nums[1:]))})'

Complexity

Pattern: Dynamic Programming

Define a state, write the transition, and stop recomputing the same subproblem. LeetCode 553. Optimal Division is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Dynamic Programming.

The dynamic programming guide has the Python template for the pattern and the 481 LeetCode problems that use it.

Related problems