Class Solution
- java.lang.Object
-
- g2201_2300.s2300_successful_pairs_of_spells_and_potions.Solution
-
public class Solution extends Object
2300 - Successful Pairs of Spells and Potions.Medium
You are given two positive integer arrays
spellsandpotions, of lengthnandmrespectively, wherespells[i]represents the strength of theithspell andpotions[j]represents the strength of thejthpotion.You are also given an integer
success. A spell and potion pair is considered successful if the product of their strengths is at leastsuccess.Return an integer array
pairsof lengthnwherepairs[i]is the number of potions that will form a successful pair with theithspell.Example 1:
Input: spells = [5,1,3], potions = [1,2,3,4,5], success = 7
Output: [4,0,3]
Explanation:
-
0th spell: 5 * [1,2,3,4,5] = [5, 10 , 15 , 20 , 25 ]. 4 pairs are successful.
-
1st spell: 1 * [1,2,3,4,5] = [1,2,3,4,5]. 0 pairs are successful.
-
2nd spell: 3 * [1,2,3,4,5] = [3,6, 9 , 12 , 15 ]. 3 pairs are successful.
Thus, [4,0,3] is returned.
Example 2:
Input: spells = [3,1,2], potions = [8,5,8], success = 16
Output: [2,0,2]
Explanation:
-
0th spell: 3 * [8,5,8] = [24 ,15, 24 ]. 2 pairs are successful.
-
1st spell: 1 * [8,5,8] = [8,5,8]. 0 pairs are successful.
-
2nd spell: 2 * [8,5,8] = [16 ,10, 16 ]. 2 pairs are successful.
Thus, [2,0,2] is returned.
Constraints:
n == spells.lengthm == potions.length1 <= n, m <= 1051 <= spells[i], potions[i] <= 1051 <= success <= 1010
-
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description int[]successfulPairs(int[] spells, int[] potions, long success)
-