Algorithm for rectangle filling, please everyone a great god, and have a question to ask,
Requirements are as follows:
1, there is a large rectangular, fixed height, width,
2, need to fill in the large rectangle N small rectangular, any small rectangular down must be complete, allow just welt
3, calculate eligible, and occupy the width of the rectangle of the minimum value,
Additional:
Best fill the result is better, if can describe character image,

CodePudding user response:

Can be filled with the skyline method

CodePudding user response:

Didn't know that you are o N the value or width of the minimum value

CodePudding user response:

Is the minimum value to ball width