Package g1201_1300.s1300_sum_of_mutated_array_closest_to_target

Class Solution

java.lang.Object

g1201_1300.s1300_sum_of_mutated_array_closest_to_target.Solution

public class Solution
extends Object

1300 - Sum of Mutated Array Closest to Target\. Medium 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 <= arr.length <= 104 * 1 <= arr[i], target <= 105

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
int	check(int v, int[] arr, int target)
int	findBestValue(int[] arr, int target)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

findBestValue

public int findBestValue(int[] arr,
 int target)

check

public int check(int v,
 int[] arr,
 int target)