kamyu104/LeetCode-Solutions

Time complexity is not O(n * 2 ^ n)

AndrewLisuxin opened this issue · 1 comments

AndrewLisuxin commented

LeetCode-Solutions/C++/optimal-account-balancing.cpp

Line 35 in 7980b27

for (const auto& s : subset) {

this for loop can be at most O(2 ^ n) times

kamyu104 commented

I fixed it. Thank you very much!