समस्या
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.
सीमाएँ
1 ≤ height, width ≤ 500. Rotation does not change the answer.
उदाहरण
इनपुट:
width = 3
height = 2
अपेक्षित आउटपुट:
expected = 2इनपुट:
long long width = 3;
long long height = 2;
अपेक्षित आउटपुट:
long long expected = 2;इनपुट:
long width = 3;
long height = 2;
अपेक्षित आउटपुट:
long expected = 2;व्याख्या
Cut off a 2 × 2 square, leaving a 2 × 1 rectangle. One more cut splits the remainder into two unit squares.
इनपुट:
width = 4
height = 4
अपेक्षित आउटपुट:
expected = 0इनपुट:
long long width = 4;
long long height = 4;
अपेक्षित आउटपुट:
long long expected = 0;इनपुट:
long width = 4;
long height = 4;
अपेक्षित आउटपुट:
long expected = 0;व्याख्या
The starting rectangle is already a square.
कैसे हल करें
पहले खुद कोशिश करें, फिर एक-एक करके संकेत खोलें।
संकेत 1
A rectangle can be solved by splitting it into two smaller rectangles and combining their best answers.
संकेत 2
Try every possible horizontal and vertical cut to find the minimum.
संकेत 3
Memoization or a table is helpful because many subrectangles repeat.
अपेक्षित जटिलता
O(h*w*(h+w)) time, O(h*w) extra space
संदर्भ
यह चुनौती CodeUtility के लिए अनुकूलित की गई है। ऊपर दिए गए स्टेटमेंट और सीमाओं का पालन करें।