[leetcode] 1300. Sum of Mutated Array Closest to Target

Description

Given an integer array arr and a target value target, return the integer value such that when we change all the integers larger than value in the given array to be equal to value, the sum of the array gets as close as possible (in absolute difference) to target.

In case of a tie, return the minimum such integer.

Notice that the answer is not neccesarilly a number from arr.

Example 1:

Input: arr = [4,9,3], target = 10
Output: 3
Explanation: When using 3 arr converts to [3, 3, 3] which sums 9 and that's the optimal answer.

Example 2:

Input: arr = [2,3,5], target = 10
Output: 5

Example 3:

Input: arr = [60864,25176,27249,21296,20204], target = 56803
Output: 11361

Constraints:

1. 1 <= arr.length <= 10^4.
2. 1 <= arr[i], target <= 10^5.

分析

题目的意思是：给你一个数组和一个target，现在要找一个value，使得数组里面大于该value的都突变成该value，问数组怎么突变可以使得数组的和最接近target。这道题我一开始题目的意思都没搞明白，后面发现理解了之后思路就来了，给数组排个序，从小到大一个一个的找，注意代码里面的结束条件，如果遍历完了之后都没找到，那就返回最大的值咯。

代码

class Solution:
    def findBestValue(self, arr: List[int], target: int) -> int:
        arr.sort()
        n=len(arr)
        for i in range(n):
            b=round(target/n)
            if(arr[i]>=b):
                return b
            target-=arr[i]
            n-=1
        return arr[-1]

参考文献

[LeetCode] Sort Python