LeetCode in Kotlin
888. Fair Candy Swap
Easy
Alice and Bob have a different total number of candies. You are given two integer arrays aliceSizes and bobSizes where aliceSizes[i] is the number of candies of the ith box of candy that Alice has and bobSizes[j] is the number of candies of the jth box of candy that Bob has.
Since they are friends, they would like to exchange one candy box each so that after the exchange, they both have the same total amount of candy. The total amount of candy a person has is the sum of the number of candies in each box they have.
Return a_n integer array_ answer where answer[0] is the number of candies in the box that Alice must exchange, and answer[1] is the number of candies in the box that Bob must exchange. If there are multiple answers, you may return any one of them. It is guaranteed that at least one answer exists.
Example 1:
Input: aliceSizes = [1,1], bobSizes = [2,2]
Output: [1,2]
Example 2:
Input: aliceSizes = [1,2], bobSizes = [2,3]
Output: [1,2]
Example 3:
Input: aliceSizes = [2], bobSizes = [1,3]
Output: [2,3]
Constraints:
1 <= aliceSizes.length, bobSizes.length <= 1041 <= aliceSizes[i], bobSizes[j] <= 105- Alice and Bob have a different total number of candies.
- There will be at least one valid answer for the given input.
Solution
class Solution {
fun fairCandySwap(aliceSizes: IntArray, bobSizes: IntArray): IntArray {
var aSum = 0
var bSum = 0
val ans = IntArray(2)
for (bar in aliceSizes) {
aSum += bar
}
for (bar in bobSizes) {
bSum += bar
}
val diff: Int = aSum - bSum
val set: HashSet<Int> = HashSet()
for (bar in aliceSizes) {
set.add(bar)
}
for (bar in bobSizes) {
if (set.contains(bar + diff / 2)) {
ans[0] = bar + diff / 2
ans[1] = bar
break
}
}
return ans
}
}