We have solved the problem with one transaction, all transactions and two transactions. What if we can only make at most three? I think The method we use in III (i.e. use two arrays to scan from left and from right separately) can not solve the problem with 3. Any clue?
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.