c#二维矩形优化排版 算法代码

下面是一个简单的 C# 二维矩形优化排版算法的示例代码：

public class Rectangle
{
    public int Width { get; set; }
    public int Height { get; set; }

    public Rectangle(int width, int height)
    {
        Width = width;
        Height = height;
    }
}

public static class RectanglePacker
{
    public static List<Rectangle> Pack(List<Rectangle> rectangles, int containerWidth, int containerHeight)
    {
        List<Rectangle> packedRectangles = new List<Rectangle>();

        int currentRowY = 0;
        int currentRowHeight = 0;

        foreach (Rectangle rectangle in rectangles)
        {
            if (currentRowY + rectangle.Height > containerHeight)
            {
                currentRowY = 0;
                currentRowHeight = 0;
            }

            if (currentRowHeight + rectangle.Height <= containerHeight)
            {
                rectangle.Width = Math.Min(rectangle.Width, containerWidth);
                rectangle.Height = Math.Min(rectangle.Height, containerHeight - currentRowHeight);

                packedRectangles.Add(rectangle);

                currentRowY += rectangle.Height;
                currentRowHeight += rectangle.Height;
            }
        }

        return packedRectangles;
    }
}

使用方法：

List<Rectangle> rectangles = new List<Rectangle>();
rectangles.Add(new Rectangle(100, 50));
rectangles.Add(new Rectangle(75, 75));
rectangles.Add(new Rectangle(50, 100));
rectangles.Add(new Rectangle(25, 25));

List<Rectangle> packedRectangles = RectanglePacker.Pack(rectangles, 200, 200);

foreach (Rectangle rectangle in packedRectangles)
{
    Console.WriteLine("Width: {0}, Height: {1}", rectangle.Width, rectangle.Height);
}

这个算法的基本思路是，从上到下依次放置矩形，如果当前行放不下某个矩形，则换行放置。在放置矩形时，会尽量使用矩形的原始宽度和高度，但是如果当前行放不下该矩形，则会将宽度调整为容器的宽度，高度调整为当前行剩余的高度。