1.递归调用
public class ClassName {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入要求的斐波那契数:");
int num = sc.nextInt();
int fi = fiBonacci(num);
System.out.println(fi);
}
public static int fiBonacci(int num){
if (num==1 || num==2){
return 1;
}
return fiBonacci(num-1)+fiBonacci(num-2);
}
}
public class ClassName {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("请输入要求的阶乘数:");
int num = sc.nextInt();
int result = factorial(num);
System.out.println(result);
}
public static int factorial(int num){
if (num == 1){
return 1;
}
return num*factorial(num-1);
}
}
public class ClassName {
public static void main(String[] args) {
multiplicationTable(1,1);
}
public static void multiplicationTable(int i,int j){
if (j>i){
System.out.println();
j=1;
i++;
}
if (i<=9){
System.out.printf("%d x %d = %-2d ", j, i, i * j);
multiplicationTable(i,j+1);
}
}
}
2. 数组
import java.util.Arrays;
public class ClassName {
public static void main(String[] args) {
int [] nums = {1,26,0,8,10,50,8,0,7,35,0,4,3,20,0,17};
int val = 0;
int [] newNums = checkZero(nums,val);
System.out.println(Arrays.toString(newNums));
}
public static int[] checkZero(int[] nums, int val){
int count = 0;
for (int i : nums){
if (i!=val){
count++;
}
}
int[] newNums = new int[count];
int j=0;
for (int i : nums){
if (i != val){
newNums[j] = i;
j++;
}
}
return newNums;
}
}
public class ClassName {
public static void main(String[] args) {
int [] nums = {1,26,0,8,10,50,8,0,7,35,0,4,3,20,0,17};
int val = 0;
int index = find_num(nums,val);
System.out.println(index);
}
public static int find_num(int[] nums, int val){
for (int i=0;i<nums.length;i++){
if (nums[i] == val){
return i;
}
}
return -1;
}
}