LeetCode Weekly Contest 20
good job well play
No one has replied
Based on the rule, we can check the 2 leading letter, there is three situations:
UU, following letters must be all upper;
UL, following letters must be all lower;
LL, same be lower;
I don't think this is DP solution
+1 for starting from back
Thanks for sharing the solution.
I do not understand the rationale behind why does subtracting the previous index from the current index for the same value give us the correct solution?
Thanks for sharing this.
Can you please explain the logic in more detail?
Thanks for sharing this. Can you please explain the logic behind this solution?
[0, 0, 11, 5] is a extremely case, which we could not Separate the first Machine to 2 machines in this case, since there is no machines on its left.
But we can always pass the first available (avg-0) number of clothes (in this case 4) to this machine from its right, and reduce the problem to n-1 case which is true based on the strong induction.
Disabled Categories are greyed out
Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.