Maximum Product of Two Elements in an Array

첫번째 코드

 

굳이 answer이라는 리스트를 만들지 말고 Max값을 비교해가면서 Max 값만을 갖고 움직이자!

 

class Solution:
    def maxProduct(self, nums: List[int]) -> int:
        Max = 0
        
        for i in range(len(nums)):
            for j in nums[i+1:]:
                Max = max(Max, (nums[i]-1)*(j-1))
        
        return Max

 

통과!

---

링크

https://github.com/ornni/leetcode/tree/main/1464-maximum-product-of-two-elements-in-an-array

leetcode/1464-maximum-product-of-two-elements-in-an-array at main · ornni/leetcode