玫瑰花动态代码html(可直接复制)

您所在的位置:网站首页 画一个漂亮的玫瑰花 玫瑰花动态代码html(可直接复制)

玫瑰花动态代码html(可直接复制)

2024-07-12 01:21| 来源: 网络整理| 查看: 265

TCP/IP基础

CSDN-Ada助手: 恭喜你,获得了 2023 博客之星评选的入围资格,请看这个帖子 (https://bbs.csdn.net/topics/616676619?utm_source=blogger_star_comment)。 请在这里提供反馈: https://blogdev.blog.csdn.net/article/details/129986459?utm_source=blogger_star_comment。

烟花简易版(直接复制可用,动态版)

2201_76111389: package love; import java.applet.Applet; import java.awt.Color; import java.awt.Graphics; import java.net.URL; import java.util.Random; /** * 烟花 * @author enjoy * */ @SuppressWarnings("serial") public class Q extends Applet implements Runnable { public int speed, variability, Max_Number, Max_Energy, Max_Patch, Max_Length, G; public String sound; private int width, height; private Thread thread = null; private BeaClassDemo bcd[]; public void init() { int i; this.setSize(1900, 900); width = getSize().width - 1; height = getSize().height - 1; speed = 1; // 烟花绽放的速度 variability = 10; Max_Number = 980; // 可发出烟花的最大数目 Max_Energy = width + 50; Max_Patch = 90; // 最大的斑点数 Max_Length = 90; // 斑点的最大距离 G = 150; // 向地面弯曲的力度 bcd = new BeaClassDemo[Max_Number]; for (i = 0; i < Max_Number; i++) bcd[i] = new BeaClassDemo(width, height, G); } public void start() { if (thread == null) { thread = new Thread(this); thread.start(); } } @SuppressWarnings("deprecation") public void stop() { if (thread != null) { thread.stop(); thread = null; } } @SuppressWarnings({ "unused", "static-access" }) public void run() { int i; int E = (int) (Math.random() * Max_Energy * 3 / 4) + Max_Energy / 4 + 1; int P = (int) (Math.random() * Max_Patch * 3 / 4) // 烟花的斑点数 + Max_Patch / 4 + 1; int L = (int) (Math.random() * Max_Length * 3 / 4) // 烟花可发射出的距离 + Max_Length / 4 + 1; long S = (long) (Math.random() * 10000); boolean sleep; Graphics g = getGraphics(); URL u = null; while (true) { try { thread.sleep(1000 / speed); } catch (InterruptedException x) { } sleep = true; for (i = 0; i < Max_Number; i++) sleep = sleep && bcd[i].sleep; if (sleep && Math.random() * 100 < variability) { E = (int) (Math.random() * Max_Energy * 3 / 4) + Max_Energy / 4 + 1; P = (int) (Math.random() * Max_Patch * 3 / 4) + Max_Patch / 4 + 1; L = (int) (Math.random() * Max_Length * 3 / 4) + Max_Length / 4 + 1; S = (long) (Math.random() * 10000); } for (i = 0; i < Max_Number; i++) { if (bcd[i].sleep && Math.random() * Max_Number * L < 1) { bcd[i].init(E, P, L, S); bcd[i].start(); } bcd[i].show(g); } } } public void paint(Graphics g) { g.setColor(Color.black); g.fillRect(0, 0, width + 1, height + 1); } } class BeaClassDemo { public boolean sleep = true; private int energy, patch, length, width, height, G, Xx, Xy, Ex[], Ey[], x, y, Red, Blue, Green, t; private Random random; public BeaClassDemo(int a, int b, int g) { width = a; height = b; G = g; } public void init(int e, int p, int l, long seed) { int i; energy = e; patch = p; length = l; // 创建一个带种子的随机数生成器 random = new Random(seed); Ex = new int[patch]; Ey = new int[patch]; Red = (int) (random.nextDouble() * 128) + 128; Blue = (int) (random.nextDouble() * 128) + 128; Green = (int) (random.nextDouble() * 128) + 128; Xx = (int) (Math.random() * width / 2) + width / 4; Xy = (int) (Math.random() * height / 2) + height / 4; for (i = 0; i < patch; i++) { Ex[i] = (int) (Math.random() * energy) - energy / 2; Ey[i] = (int) (Math.random() * energy * 7 / 8) - energy / 8; } } public void start() { t = 0; sleep = false; } public void show(Graphics g) { if (!sleep) if (t < length) { int i, c; double s; Color color; c = (int) (random.nextDouble() * 64) - 32 + Red; if (c >= 0 && c < 256) Red = c; c = (int) (random.nextDouble() * 64) - 32 + Blue; if (c >= 0 && c < 256) Blue = c; c = (int) (random.nextDouble() * 64) - 32 + Green; if (c >= 0 && c < 256) Green = c; color = new Color(Red, Blue, Green); for (i = 0; i < patch; i++) { s = (double) t / 100; x = (int) (Ex[i] * s); y = (int) (Ey[i] * s - G * s * s); g.setColor(color); g.drawLine(Xx + x, Xy - y, Xx + x, Xy - y); if (t >= length / 2) { int j; for (j = 0; j < 2; j++) { s = (double) ((t - length / 2) * 2 + j) / 100; x = (int) (Ex[i] * s); y = (int) (Ey[i] * s - G * s * s); g.setColor(Color.black); g.drawLine(Xx + x, Xy - y, Xx + x, Xy - y); } } } t++; } else { sleep = true; } } }

JDBC.

CSDN-Ada助手: 不知道 Java 技能树是否可以帮到你:https://edu.csdn.net/skill/java?utm_source=AI_act_java



【本文地址】


今日新闻


推荐新闻


CopyRight 2018-2019 办公设备维修网 版权所有 豫ICP备15022753号-3