1、冒泡排序
package com.example.test;
public class sort {
public static void main(String[] args) {
//冒泡排序算法
int[] numbers = new int[]{1, 5, 6, 2, 3, 7, 4};
//需进行length-1次冒泡
for (int i = 0; i < numbers.length - 1; i++) {
for (int j = 0; j < numbers.length - 1 - i; j++) {
if (numbers[j] > numbers[j + 1]) {
int temp = numbers[j];
numbers[j] = numbers[j + 1];
numbers[j + 1] = temp;
}
}
}
System.out.println("从小到大排序后的结果是:");
for (int i = 0; i < numbers.length; i++)
System.out.print(numbers[i] + " ");
}
}
从大到小只需将如下改成大于号:
2、递归函数
package com.example.test;
public class dg {
private static long digui(int n) {
if (n == 0) {
return 1;
}else {
return n*digui(n-1);
}
}
public static void main(String[] args) {
System.out.println(dg.digui(5));
}
}
3、四个方向九九乘法口诀
package com.example.test;
public class cfkj {
public static void main(String[] args) {
printTable1();
printTable2();
printTable3();
printTable4();
}
//左下角
private static void printTable1() {
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= i; j++) {
System.out.print(j + "*" + i + "=" + (i * j) + "\t");
}
System.out.println();
}
}
//左上角
private static void printTable2() {
for (int i = 9; i >= 1; i--) {
for (int j = 1; j <= i; j++) {
System.out.print(j + "*" + i + "=" + (i * j) + "\t");
}
System.out.println();
}
}
//右下角
private static void printTable3() {
for (int i = 1; i <= 9; i++) {
for (int j = 9; j >= 1; j--) {
if (j > i) {
System.out.print("\t\t");
} else {
System.out.print("\t" + i * j + "=" + i + "*" + j);
}
}
System.out.println();
}
}
//右上角
private static void printTable4() {
for (int i = 9; i >= 1; i--) {
for (int j = 9; j >= 1; j--) {
if (j > i) {
System.out.print("\t\t");
} else {
System.out.print("\t" + i * j + "=" + i + "*" + j);
}
}
System.out.println();
}
}
}
针对笔试部分我会系列性的分享,感谢大家的收藏加关注哦!❤❤❤