Package g1201_1300.s1298_maximum_candies_you_can_get_from_boxes

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    1298 - Maximum Candies You Can Get from Boxes.

    Hard

    You have n boxes labeled from 0 to n - 1. You are given four arrays: status, candies, keys, and containedBoxes where:

    • status[i] is 1 if the <code>i<sup>th</sup></code> box is open and 0 if the <code>i<sup>th</sup></code> box is closed,

    • candies[i] is the number of candies in the <code>i<sup>th</sup></code> box,

    • keys[i] is a list of the labels of the boxes you can open after opening the <code>i<sup>th</sup></code> box.

    • containedBoxes[i] is a list of the boxes you found inside the <code>i<sup>th</sup></code> box.

    You are given an integer array initialBoxes that contains the labels of the boxes you initially have. You can take all the candies in any open box and you can use the keys in it to open new boxes and you also can use the boxes you find in it.

    Return the maximum number of candies you can get following the rules above.

    Example 1:

    Input: status = 1,0,1,0, candies = 7,5,4,100, keys = [ [],[],1,[]], containedBoxes = [1,2,3,[],[]], initialBoxes = 0

    Output: 16

    Explanation: You will be initially given box 0. You will find 7 candies in it and boxes 1 and 2.

    Box 1 is closed and you do not have a key for it so you will open box 2. You will find 4 candies and a key to box 1 in box 2.

    In box 1, you will find 5 candies and box 3 but you will not find a key to box 3 so box 3 will remain closed.

    Total number of candies collected = 7 + 4 + 5 = 16 candy.

    Example 2:

    Input: status = 1,0,0,0,0,0, candies = 1,1,1,1,1,1, keys = [1,2,3,4,5,[],[],[],[],[]], containedBoxes = [1,2,3,4,5,[],[],[],[],[]], initialBoxes = 0

    Output: 6

    Explanation: You have initially box 0. Opening it you can find boxes 1,2,3,4 and 5 and their keys.

    The total number of candies will be 6.

    Constraints:

    • n == status.length == candies.length == keys.length == containedBoxes.length

    • 1 &lt;= n &lt;= 1000

    • status[i] is either 0 or 1.

    • 1 &lt;= candies[i] &lt;= 1000

    • 0 &lt;= keys[i].length &lt;= n

    • 0 &lt;= keys[i][j] &lt; n

    • All values of keys[i] are unique.

    • 0 &lt;= containedBoxes[i].length &lt;= n

    • 0 &lt;= containedBoxes[i][j] &lt; n

    • All values of containedBoxes[i] are unique.

    • Each box is contained in one box at most.

    • 0 &lt;= initialBoxes.length &lt;= n

    • 0 &lt;= initialBoxes[i] &lt; n

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Integer maxCandies(IntArray status, IntArray candies, Array<IntArray> keys, Array<IntArray> containedBoxes, IntArray initialBoxes)

      • Methods inherited from class java.lang.Object

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