Leetcode 每日一题：

class Solution:
    def findBestValue(self, arr: List[int], target: int) -> int:
        s=0
        s1=0
        max1 = max(arr)
        d=  target//len(arr)
        while True:
            s1= s
            s=0
            for i in range(len(arr)):
                
                if arr[i]>d:
                    s+=d
                else:
                    s+=arr[i]
           
            if s<target and s!=sum(arr):

                d+=1
            elif s==target:
                return d
            elif s==sum(arr):
                return d
            else:
                break
        # print(s1,s,d)
        if abs(s1-target)<=abs(s-target):     

            return d-1
        else:
            return d