20 lines
645 B
Python
20 lines
645 B
Python
# https://leetcode.com/problems/successful-pairs-of-spells-and-potions
|
|
|
|
from typing import List
|
|
|
|
class Solution:
|
|
def successfulPairs(self, spells: List[int], potions: List[int], success: int) -> List[int]:
|
|
potions.sort()
|
|
for i in range(len(spells)):
|
|
spell = spells[i]
|
|
left = 0
|
|
right = len(potions) - 1
|
|
while left <= right:
|
|
mid = (left + right) // 2
|
|
if spell * potions[mid] >= success:
|
|
right = mid - 1
|
|
else:
|
|
left = mid + 1
|
|
spells[i] = len(potions) - left
|
|
return spells
|
|
|