파비의 매일매일 공부기록

2023.12.13 Today's Challenge 본문

Problem Solving/LeetCode

2023.12.13 Today's Challenge

fabichoi 2023. 12. 13. 23:45

https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/

 

Maximum Product of Two Elements in an Array - LeetCode

Can you solve this real interview question? Maximum Product of Two Elements in an Array - Given the array of integers nums, you will choose two different indices i and j of that array. Return the maximum value of (nums[i]-1)*(nums[j]-1).   Example 1: Inpu

leetcode.com

 가장 큰 값 2개 뽑아서 계산하면 끝

class Solution:
    def maxProduct(self, nums: List[int]) -> int:
        nums.sort(reverse=True)
        return (nums[0]-1) * (nums[1]-1)
반응형

'Problem Solving > LeetCode' 카테고리의 다른 글

2023.12.15 Today's Challenge  (0) 2023.12.15
2023.12.14 Today's Challenge  (0) 2023.12.14
2023.12.12 Today's Challenge  (0) 2023.12.12
2023.12.11 Today's Challenge  (0) 2023.12.11
2023.12.10 Today's Challenge  (0) 2023.12.10
'Problem Solving/LeetCode' Related Articles more
Comments