java倒三角形代码 java中倒三角和正三角的代码( 四 )


int i,j,N=5;
for(i=N;i=1;i--){
for(j=1;j=N-i;j++){
System.out.print(" ");
}
for(j=i*2-1;j=1;j--){
System.out.print("*");
}
System.out.println();
}
}
}
运行结果
用JAVA编写程序实现在控制台用“*”输出一个倒立的等边三角型 , 并写到文件triangle.txt中1、创建java类,TestTriangle,
2、编写java代码,实现倒立等边三角形的打?。?
public void print() {
String tri_str = "";
for (int i = 0; ia; i++) {
for (int m = 0; mi; m++) {
tri_str += " ";
System.out.print(" ");
}
for (int j = 0; ja - i; j++) {
tri_str += "* ";
System.out.print("* ");
}
tri_str += "\r\n";
System.out.println();
}
outPrint(tri_str);
}
3、再编写输出triangle.txt文件的代码 , 
public void outPrint(String str1) {
try {
PrintStream ps = new PrintStream("triangle.txt");
ps.append(str1);
ps.close();
} catch (FileNotFoundException e) {
e.printStackTrace();
}
}
4、执行java代码,控制台输出*号倒三角,
5、查看triangle.txt文件,同样是*号倒三角,
java输出星号倒三角形/**
* 输出各种三角形,菱形,正方形
* @author young
*
*/
public class TrianglePrint {
// 空心直角
public static void kxzj() {
for (int i = 0; i6; i++) {
for (int j = 0; j = i; j++) {
if (i != 5) {
if (j == 0 || j == i) {
System.out.print("*");
} else {
System.out.print(" ");
}
} else {
System.out.print("*");
}
}
System.out.println();
}
}
// 等边
public static void db() {
for (int i = 1; i = 5; i++) {
for (int j = 1; j = 5 - i; j++) {
System.out.print(" ");
}
if (i != 5) {
for (int k = 1; k = 2 * i - 1; k++) {
if (k == 1 || k == 2 * i - 1) {
System.out.print("*");
} else {
System.out.print(" ");
}
}
} else {
for (int k = 1; k = 2 * i - 1; k++) {
if (k % 2 != 0) {
System.out.print("*");
} else {
System.out.print(" ");
}
}
}
System.out.println();
}
}
// 正三角
public static void p1() {
int n = 5;
int a = 0;
int b = 0;
for (int i = 1; i = n; i++) {
if (a != (n - i)) {
System.out.print(" ");
a++;
i = i - 1;
} else if (b != (2 * i - 1)) {
System.out.print("*");
b++;
i = i - 1;
} else if (a == (n - i)b == (2 * i - 1)) {
System.out.println();
a = 0;
b = 0;
}
}
}
// 倒三角
public static void p2() {
int n = 5;
int a = 0;
int b = 0;
for (int i = n; i = 1; i--) {
if (a != (n - i)) {
System.out.print(" ");
a++;
i = i + 1;
} else if (b != (2 * i - 1)) {
System.out.print("*");
b++;
i = i + 1;
} else if (a == (n - i)b == (2 * i - 1)) {
System.out.println();
a = 0;
b = 0;
}
}
}
// 倒三角:用户决定行数
public static void sta(int n) {
for (int i = 0; in; i++) {
for (int j = 0; ji; j++) {
System.out.print(" ");
}
for (int k = 0; k2 * (n - i) - 1; k++) {
System.out.print("*");
}
System.out.println();
}
}
// 输出正方形
public static void zf(int N) {
for (int i = 1; i = N; i++) {
for (int j = 1; j = N; j++) {
if (j == 1 || j == N || i == 1 || i == N)
System.out.print("*");
else
System.out.print(" ");
}
System.out.println();
}
}
// 输出正菱形
public static void lx(int n) {

推荐阅读