数组—遍历
public static void ergodic(int[] arr) {
for (int i = 0; i < arr.length; i++) {
if (i < arr.length - 1) {
System.out.print(arr[i] + ",");
} else {
System.out.println(arr[i]);
}
}
}
数组—获取数组最大值
public static int getMax(int[] arr) {
for (int i = 0; i < arr.length; i++) {
if (arr[0] < arr[i])
arr[0] = arr[i];
} return arr[0];
}
数组—直接排序
public static void sort(int[] arr) {
for (int i = 0; i < arr.length - 1; i++) {
for (int j = i + 1; j < arr.length; j++) {
if (arr[i] > arr[j]) {
int c = arr[i];
arr[i] = arr[j];
arr[j] = c;
}
}
}
}
数组—冒泡排序
public static void bubbleSort(int[] arr) {
for (int i = 0; i < arr.length - 1; i++) {
for (int j = 0; j < arr.length - 1 - i; j++) {
if (arr[j] > arr[j + 1]) {
int c = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = c;
}
}
}
}
数组—折半查询
/折半查找 注:数组必须是有序的
*/
public static int getHalf1(int[] arr, int num) {
int min = 0, max = arr.length - 1, mid;
while (min <= max) {
mid = (min + max) / 2;
if (num > arr[mid]) {
min = mid + 1;
} else if (num < arr[mid]) {
max = mid - 1;
} else {
return mid;
}
}return -1;
}
**方法2**
public static int getHalf2(int[] arr, int num) {
int min = 0, max = arr.length - 1, mid = (min + max) / 2;
while (arr[mid] != num) {
if (num > arr[mid]) {
min = mid + 1;
} else if (num < arr[mid]) {
max = mid - 1;
}
if (min > max) {
return -1;
}
mid = (min + max) / 2;
}
return mid;
打印一个99乘法表
for(int i=0;i<9;i++){
for (int j=0;j<=i;j++){
System.out.print((j+1)+"*"+(i+1)+"="+(i+1)*(j+1)+"\t");
}System.out.println();
}
求出1~100相加的总和,奇数总和,偶数总和
int sum1=0,
sum2=0,
sum3=0;
for (int i=0;i<=100;i++){
sum1+=i;
if (i%2==0){
sum2+=i;
}else {
sum3+=i;
}
}
System.out.println("1~100总和"+sum1);
System.out.println("1~100偶数的总和"+sum2);
System.out.println("1~100奇数的总和"+sum3);
打印三角形
for (int i=0;i<5;i++){
for (int k=i;k<5;k++){
System.out.print(" ");
}
for (int j=0;j<=i;j++){
System.out.print("* ");
}
System.out.println();
}