JAVA学习笔记(二)金字塔、求和、数组定义、冒泡排序

来源:互联网 发布:js获取标签所有属性 编辑:程序博客网 时间:2024/06/05 05:39
java.util.Scanner san = new java.util.Scanner(System.in);System.out.print("请输入行数:");int t = san.nextInt();
for(int i=0;i<t;i++) {for(int j=0;j<=(t-i-2);j++) {System.out.print(" ");}for(int k=0;k<(2*i+1);k++) {System.out.print("*");}System.out.println();}
int i=0;do {System.out.print(i);i++;}while(i<10);
int i=0;while(i<10) {System.out.print(i);i++;}
int sum=0;for(int i=1;i<=100;i++) {if(i==50) {continue;}sum += i;}System.out.println(sum);
int a[] = new int[4];
int a[];a = new int[4];a[0] = 34;a[1] = 23;a[2] = 16;a[3] = 25;
int a[] = new int[]{14,23,21,14};
//冒泡排序int[] arrayOfInts = new int[]{2,3,1,5,6,3,2,0,5};int temp;for(int i=arrayOfInts.length;--i>0;) {for(int j=0;j<i;j++) {if(arrayOfInts[j]>arrayOfInts[j+1]) {temp = arrayOfInts[j];arrayOfInts[j] = arrayOfInts[j+1];arrayOfInts[j+1] = temp;}}}for(int i=0;i<arrayOfInts.length;i++) {System.out.print(arrayOfInts[i] + " ");}