[LeetCode] 0016. 3Sum Closest

/ Leetcode, 技術文章 / 作者:

Explore diverse LeetCode solutions in Python, C++, JavaScript, SQL, and TypeScript. Ideal for interview prep, learning, and code practice in multiple programming languages. Github Repo Link

內容目錄

Medium

 

Given an integer array nums of length n and an integer target, find three integers in nums such that the sum is closest to target.

Return the sum of the three integers.

You may assume that each input would have exactly one solution.

Example 1:

Input: nums = [-1,2,1,-4], target = 1
Output: 2
Explanation: The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).

Example 2:

Input: nums = [0,0,0], target = 1
Output: 0
Explanation: The sum that is closest to the target is 0. (0 + 0 + 0 = 0).

Constraints:

  • 3 <= nums.length <= 500
  • -1000 <= nums[i] <= 1000
  • -104 <= target <= 104

Python

				
					# time complexity: O(n)
# space complexity: O(n)
from typing import List


class Solution(object):
    def maxProfit(self, prices: List[int]) -&gt; int:
        if len(prices) &lt;= 1:
            return 0

        leftMin = prices[0]
        rightMax = prices[-1]

        length = len(prices)
        leftProfits = [0] * length
        rightProfits = [0] * (length + 1)

        for l in range(1, length):
            leftProfits[l] = max(leftProfits[l - 1], prices[l] - leftMin)
            leftMin = min(leftMin, prices[l])

            r = length - 1 - l
            rightProfits[r] = max(rightProfits[r + 1], rightMax - prices[r])
            rightMax = max(rightMax, prices[r])

        maxProfit = 0
        print(leftProfits)
        print(rightProfits)
        for i in range(0, length):
            maxProfit = max(maxProfit, leftProfits[i] + rightProfits[i + 1])

        return maxProfit


prices = [7, 1, 5, 3, 6, 4]
# leftProfit = [0, 0, 4, 4, 5, 5]
# rightProfit = [5, 5, 3, 3, 0, 0, 0]
print(Solution().maxProfit(prices))

相關文章