## 21 Aug Markham Saturday 14:00 Java Homework 21.08.14.

**Question:**

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

*i*_{th}box of candy that Alice has and bobSizes[

**] is the number of candies of the**

*j*

**j**_{th}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 an 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]Explanation:In this example, alice has one candy in box one and two candies in box two. Bob has two candies in both box one and two. In order to make sure that both bob and alice have the same number of candy, alice must exchange 1 candy with 2 candy of bob. So the answer is [1,2] where 1 represent the one candy that she exchanged with bob and 2 represent the 2 candies that bob exchange with alice.Example 2:Input:aliceSizes = [1,2], bobSizes = [2,3]Output:[1,2]Example 3:Input:aliceSizes = [2], bobSizes = [1,3]Output:[2,3]Example 4:Input:aliceSizes = [1,2,5], bobSizes = [2,4]Output:[5,4]

Sorry, the comment form is closed at this time.