LeetCode 2043. Simple Bank System
原题链接在这里:https://leetcode.com/problems/simple-bank-system/description/
题目:
You have been tasked with writing a program for a popular bank that will automate all its incoming transactions (transfer, deposit, and withdraw). The bank has n
accounts numbered from 1
to n
. The initial balance of each account is stored in a 0-indexed integer array balance
, with the (i + 1)th
account having an initial balance of balance[i]
.
Execute all the valid transactions. A transaction is valid if:
- The given account number(s) are between
1
andn
, and - The amount of money withdrawn or transferred from is less than or equal to the balance of the account.
Implement the Bank
class:
Bank(long[] balance)
Initializes the object with the 0-indexed integer arraybalance
.boolean transfer(int account1, int account2, long money)
Transfersmoney
dollars from the account numberedaccount1
to the account numberedaccount2
. Returntrue
if the transaction was successful,false
otherwise.boolean deposit(int account, long money)
Depositmoney
dollars into the account numberedaccount
. Returntrue
if the transaction was successful,false
otherwise.boolean withdraw(int account, long money)
Withdrawmoney
dollars from the account numberedaccount
. Returntrue
if the transaction was successful,false
otherwise.
Example 1:
Input ["Bank", "withdraw", "transfer", "deposit", "transfer", "withdraw"] [[[10, 100, 20, 50, 30]], [3, 10], [5, 1, 20], [5, 20], [3, 4, 15], [10, 50]] Output [null, true, true, true, false, false] Explanation Bank bank = new Bank([10, 100, 20, 50, 30]); bank.withdraw(3, 10); // return true, account 3 has a balance of $20, so it is valid to withdraw $10. // Account 3 has $20 - $10 = $10. bank.transfer(5, 1, 20); // return true, account 5 has a balance of $30, so it is valid to transfer $20. // Account 5 has $30 - $20 = $10, and account 1 has $10 + $20 = $30. bank.deposit(5, 20); // return true, it is valid to deposit $20 to account 5. // Account 5 has $10 + $20 = $30. bank.transfer(3, 4, 15); // return false, the current balance of account 3 is $10, // so it is invalid to transfer $15 from it. bank.withdraw(10, 50); // return false, it is invalid because account 10 does not exist.
Constraints:
n == balance.length
1 <= n, account, account1, account2 <= 105
0 <= balance[i], money <= 1012
- At most
104
calls will be made to each functiontransfer
,deposit
,withdraw
.
题解:
Check account index is there before deposit.
Check account index is there and if enough balance before withdraw.
For transfer, check account2 exists and if withdraw from account1 success, then return deposit to account2.
Note: need to check account2 exists first, otherwise, the withdraw happens, but deposit is not there, then the money is lost.
Time Complexity: transfer, O(1). deposit, O(1). withdraw, O(1).
Space: O(1).
AC Java:
1 class Bank { 2 long[] balance; 3 4 public Bank(long[] balance) { 5 this.balance = balance; 6 } 7 8 public boolean transfer(int account1, int account2, long money) { 9 if(account2 <= balance.length && withdraw(account1, money)){ 10 return deposit(account2, money); 11 } 12 13 return false; 14 } 15 16 public boolean deposit(int account, long money) { 17 if(account <= balance.length){ 18 balance[account - 1] += money; 19 return true; 20 } 21 22 return false; 23 } 24 25 public boolean withdraw(int account, long money) { 26 if(account <= balance.length && balance[account - 1] >= money){ 27 balance[account - 1] -= money; 28 return true; 29 } 30 31 return false; 32 } 33 } 34 35 /** 36 * Your Bank object will be instantiated and called as such: 37 * Bank obj = new Bank(balance); 38 * boolean param_1 = obj.transfer(account1,account2,money); 39 * boolean param_2 = obj.deposit(account,money); 40 * boolean param_3 = obj.withdraw(account,money); 41 */
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 终于写完轮子一部分:tcp代理 了,记录一下
· 震惊!C++程序真的从main开始吗?99%的程序员都答错了
· 别再用vector<bool>了!Google高级工程师:这可能是STL最大的设计失误
· 单元测试从入门到精通
· 【硬核科普】Trae如何「偷看」你的代码?零基础破解AI编程运行原理
2022-08-04 LeetCode 1400. Construct K Palindrome Strings
2022-08-04 LeetCode 1950. Maximum of Minimum Values in All Subarrays
2022-08-04 LeetCode 2187. Minimum Time to Complete Trips
2022-08-04 1438. Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
2019-08-04 LeetCode 841. Keys and Rooms
2019-08-04 LeetCode 1061. Lexicographically Smallest Equivalent String
2019-08-04 LeetCode 1102. Path With Maximum Minimum Value