Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 553 with 19 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 553 # by problem number
lcpy gen -s optimal_division # by problem name
nums. The adjacent integers in nums will perform the float division.
nums = [2,3,4], we will evaluate the expression "2/3/4".Input: nums = [1000,100,10,2]
Output: "1000/(100/10/2)"
Explanation: 1000/(100/10/2) = 1000/((100/10)/2) = 200
However, the bold parenthesis in "1000/((100/10)/2)" are redundant since they do not influence the operation priority.
So you should return "1000/(100/10/2)".
Other cases:
1000/(100/10)/2 = 50
1000/(100/(10/2)) = 50
1000/100/10/2 = 0.5
1000/100/(10/2) = 2
Input: nums = [2,3,4]
Output: "2/(3/4)"
Explanation: (2/(3/4)) = 8/3 = 2.667
It can be shown that after trying all possibilities, we cannot get an expression with evaluation greater than 2.667
class Solution:
# Time: O(n)
# Space: O(n)
def optimal_division(self, nums: list[int]) -> str:
if len(nums) == 1:
return str(nums[0])
if len(nums) == 2:
return f"{nums[0]}/{nums[1]}"
return f"{nums[0]}/(" + "/".join(str(x) for x in nums[1:]) + ")"
| Time | Space |
|---|---|
| O(n) | O(n) |