//杨辉三角
public class Test1{
public int count(int x,int y){
return (y==1||x==y)?1:count(x-1,y-1)+count(x-1,y);
}
public void list(int len){
for(int i=1;i<=len;i++)
for(int j=1;j<=i;j++)
System.out.print(count(i,j)+(j==i?"\n":" "));
}
public static void main(String args[]){
new Test1().list(10);
}
}
//五角星
import java.awt.*;
import javax.swing.*;
public class Test1 extends JPanel {
private JFrame frame = null;
private int r = 50; // 半径
private int[] x = new int[5]; // 5个X顶点坐标
private int[] y = new int[5]; // 5个Y顶点坐标
public Test1() {
本内容试读结束,登录后可阅读更多
下载后可阅读完整内容,剩余2页未读,立即下载