Class Solution
- java.lang.Object
-
- g0801_0900.s0888_fair_candy_swap.Solution
-
public class Solution extends Object
888 - Fair Candy Swap.Easy
Alice and Bob have a different total number of candies. You are given two integer arrays
aliceSizes
andbobSizes
wherealiceSizes[i]
is the number of candies of theith
box of candy that Alice has andbobSizes[j]
is the number of candies of thejth
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
whereanswer[0]
is the number of candies in the box that Alice must exchange, andanswer[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 <= 104
1 <= 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.
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description int[]
fairCandySwap(int[] aliceSizes, int[] bobSizes)
-