Problème
On each move, choose one rectangle and cut all the way across it, parallel to a side, making two rectangles with positive integer side lengths. Continue until every piece is a square. Squares may have different sizes. Count cuts, not pieces.
Implement rectangle_cutting(height, width).
Input
height: The starting rectangle height.
width: The starting rectangle width.
Output
Return the minimum number of cuts.
Contraintes
1 ≤ height, width ≤ 500. Rotation does not change the answer.
Exemples
Entrée :
width = 3
height = 2
Sortie attendue :
expected = 2Entrée :
long long width = 3;
long long height = 2;
Sortie attendue :
long long expected = 2;Entrée :
long width = 3;
long height = 2;
Sortie attendue :
long expected = 2;Explication
Cut off a 2 × 2 square, leaving a 2 × 1 rectangle. One more cut splits the remainder into two unit squares.
Entrée :
width = 4
height = 4
Sortie attendue :
expected = 0Entrée :
long long width = 4;
long long height = 4;
Sortie attendue :
long long expected = 0;Entrée :
long width = 4;
long height = 4;
Sortie attendue :
long expected = 0;Explication
The starting rectangle is already a square.
Comment l'aborder
Essayez d'abord seul, puis ouvrez les indices un par un.
Indice 1
A rectangle can be solved by splitting it into two smaller rectangles and combining their best answers.
Indice 2
Try every possible horizontal and vertical cut to find the minimum.
Indice 3
Memoization or a table is helpful because many subrectangles repeat.
Complexité attendue
O(h*w*(h+w)) time, O(h*w) extra space
Références
Ce défi a été adapté pour CodeUtility. Suivez l'énoncé et les contraintes ci-dessus.