Find the pattern, from the 2d array, we know that we can cut the brick if most the row has the same length. So we just use hashtable to store each accumulate length and push it.
Error:
N/A
Find the pattern, from the 2d array, we know that we can cut the brick if most the row has the same length. So we just use hashtable to store each accumulate length and push it.
Error:
N/A