Name:Unknown
Clan:Unknown
Member Since:Feb 2019
Last Seen:Apr 2021
Profiles:
Following:1
Followers:1
Allies:1
Loading collection data...
Collections are a way for you to organize kata so that you can create your own training routines. Every collection you create is public and automatically sharable with other warriors. After you have added a few kata to a collection you and others can train on the kata contained within the collection.
Get started now by creating a new collection.
Nice realization that all permutations don't need to be computed!
I think I get it. Thank you
This comment is hidden because it contains spoiler information about the solution
The idea is to "simulate" all the rows with an easy method: just take the numbers of customers and add to the queue with the lowest value. Then you return the highest value queue.
in detail: first we create another vector of values of fixed size (n) and set the values to 0.
then we iterate all the customers values (int i : customers) where i is getting the value of customers[0],[1]...etc; and we add that value to de lowest value queue.
at the end we got a vector of n values (queues) and we just have to return the max value of them.
Can someone try to explain this one to me? :)
Would love if someone explained this solution to me.
I'm not very experienced when it comes to iterators.