Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 3711 with 16 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 3711 # by problem number
lcpy gen -s maximum_transactions_without_negative_balance # by problem name
transactions, where transactions[i] represents the amount of the i-th transaction:
Input: transactions = [2,-5,3,-1,-2]
Output: 4
Explanation:
One optimal sequence is [2, 3, -1, -2], balance: 0 -> 2 -> 5 -> 4 -> 2.
Input: transactions = [-1,-2,-3]
Output: 0
Explanation:
All transactions are negative. Including any would make the balance negative.
Input: transactions = [3,-2,3,-2,1,-1]
Output: 6
Explanation:
All transactions can be taken in order, balance: 0 -> 3 -> 1 -> 4 -> 2 -> 3 -> 2.
import heapq
class Solution:
# Time: O(n log n)
# Space: O(n)
def max_transactions(self, transactions: list[int]) -> int:
kept: list[int] = []
balance = 0
ans = len(transactions)
for amount in transactions:
balance += amount
heapq.heappush(kept, amount)
while balance < 0:
balance -= heapq.heappop(kept)
ans -= 1
return ans
| Time | Space |
|---|---|
| O(n log n) | O(n) |