JAVA练习题2

最新推荐文章于 2024-07-23 21:37:49 发布

thosakapie

最新推荐文章于 2024-07-23 21:37:49 发布

阅读量366

点赞数 10

文章标签： java 算法开发语言

本文链接：https://blog.csdn.net/thosakapie/article/details/135026017

版权

Java练习题2

java打印99乘法表

import java.util.Scanner;
public class practice {
    public static void main(String[] args){
    Scanner scanner = new Scanner(System.in);
        System.out.println("please enter number");
    int rows = scanner.nextInt();
    nnprint(rows);
    }
    // 键盘录入一个数据n(1<=n<=9)，输出对应的nn乘法表
    // 以99乘法表为例
    public static void nnprint(int rows){
        for (int i=1;i<=rows;i++){
            for(int j =1;j<=i;j++){
                System.out.print(j + " * " + i + " = " + i * j);
                System.out.print("\t");
            } System.out.println();
        }

    }
}

翻转数组

public class practice3 {
    public static void main(String[] args){
     int[] arr = {1,2,3,4,5,6,7,8};
        for (int i = 0; i < arr.length/2; i++) {
            int first = arr[i];
            arr[i] = arr[arr.length-1-i];
            arr[arr.length-1-i] = first;

        }
        for (int j = 0; j < arr.length; j++) {
            System.out.print(arr[j]+ " ");

        };

        }
    }

杨辉三角（二维数组）

import java.util.Scanner;
public class yanghuisanjiao {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.println("please enter a number");
        int rows = scanner.nextInt();

        int[][] p = new int[rows][rows];
        for (int i = 0; i <rows; i++) {
            for (int j = 0; j <=i; j++) {
                if (j==0 | j == i){
                    p[i][j] = 1;
                }else {//i =4 ,j = 2
                    p[i][j] = p[i-1][j-1]+ p[i-1][j];
                }

            }


                }for (int i  = 0; i< rows; i++) {
            for (int j = 0; j <=i; j++) {
                System.out.print(p[i][j] + " ");


                
            }
            System.out.println();

        }
    }
}

实现阶乘

import java.util.Scanner;
public class practice5 {
    public static void main(String[] args){
    Scanner scanner = new Scanner(System.in);
        System.out.println("number");
    int num = scanner.nextInt();
        System.out.println(factorial(num));
    }
    public static int factorial(int num){

        if (num==1){return 1;}
        return num*factorial(num - 1);

    }
}

从数组中选择最大最小值

public class practice4 {
    public static void main(String[] args){
        int[]  arr = {5,1,1,4,2,4,5,6,7,2,7,9,34,1,3546,856,12,54,24};
        int maxx = getmaxmin(arr)[0];
        int minn = getmaxmin(arr)[1];
        System.out.println(maxx);
        System.out.println(minn);
    }
    public static int[] getmaxmin(int[] arr){
        int max = arr[0];
        int min = arr[0];
        for (int i:arr) {
            if(i > max){
                max = i;}
            if (i<min){
                min = i;
            }
        }int res[] = {max,min};
        return res;

    }

    }