leetcode-转变数组后最接近目标值的数组和

class Solution {
    public int findBestValue(int[] arr, int target) {
        int length = arr.length;
        Arrays.sort(arr);
        int minindex = -1;
        int mincount = -1;
        for(int i=0;i<=target;i+=1){
            int count = 0;
            for(int k=0;k<length;k+=1){
                int num = arr[k];
                if(num>i){
                    count += (length-k)*i;
                    break;
                }
                else{
                    count +=arr[k];
                }
            }
            if(count == target){
                return i;
            }
            if(minindex == -1){
                minindex = i;
                mincount = count;
            }
            else{
                if(Math.abs(mincount-target)>Math.abs(count-target)){
                    minindex = i;
                    mincount = count;
                }
            }
        }
        return minindex;
    }
}class Solution {
    public int findBe