Java中的递归Sierpinski三角形？

import java.awt.*;
import javax.swing.*;

public class SierpinskiTriangle extends JPanel {
    private int level;

    public SierpinskiTriangle(int level) {
        this.level = level;
    }

    @Override
    protected void paintComponent(Graphics g) {
        super.paintComponent(g);
        drawSierpinski(g, level, getWidth() / 2, 0, getWidth(), getHeight());
    }

    private void drawSierpinski(Graphics g, int level, int x, int y, int width, int height) {
        if (level == 0) {
            int[] xPoints = {x, x + width / 2, x - width / 2};
            int[] yPoints = {y, y + height, y + height};
            g.fillPolygon(xPoints, yPoints, 3);
        } else {
            int newWidth = width / 2;
            int newHeight = height / 2;
            drawSierpinski(g, level - 1, x, y, newWidth, newHeight);
            drawSierpinski(g, level - 1, x + newWidth, y + newHeight, newWidth, newHeight);
            drawSierpinski(g, level - 1, x - newWidth, y + newHeight, newWidth, newHeight);
        }
    }

    public static void main(String[] args) {
        int level = 5; // 设置递归的层数
        JFrame frame = new JFrame("Sierpinski Triangle");
        frame.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
        frame.setSize(800, 800);
        frame.add(new SierpinskiTriangle(level));
        frame.setVisible(true);
    }
}