Java零基础入门到精通_Day 6

java 复制代码
package Base_One;

import java.util.Scanner;

public class Base_006 {
    public static void main(String[] args) {
       int [] arr = new int[20];
       arr[0] = 1;
       arr[1] = 1;
       for(int i=2;i< arr.length;i++){
            arr[i] = arr[i-1]+arr[i-2];
        }
        System.out.println(arr[19]);
    }
}
java 复制代码
package Base_One;

public class Base_006 {
    public static void main(String[] args) {
        int i, j;
        for (i = 0; i <= 20; i++) {
            for (j = 0; j <= 33; j++) {
                int k = 100 - i - j;
                if (k % 3 == 0 && 5 * i + 3 * j + k / 3 == 100) {
                    System.out.print(i + ",");
                    System.out.print(j + ",");
                    System.out.print(k+" ");
                }

            }
        }
    }
}
java 复制代码
package Base_One;

public class Base_006 {
    public static void main(String[] args) {
        int [] arr = {68,27,95,88,171,996,51,210};
        int sum = 0;
        for (int i = 0;i< arr.length;i++){
            if (arr[i]%10 != 7 && arr[i]%2 == 0 && arr[i]/10%7 != 7){
                sum += arr[i];
            }
        }
        System.out.println(sum);
    }
}
java 复制代码
package Base_One;

public class Base_006 {
    public static void main(String[] args) {
        int [] arr1 = {68,27,95,88,171,996,51,210};
        int [] arr2 = {68,27,95,88,171,996,51,210};
        boolean flag= compare(arr1,arr2);
        System.out.println(flag);
    }
    public static boolean compare(int [] arr1,int []arr2){
        boolean flag = true;

        if (arr1.length != arr2.length){
            return false;
        }

        for (int j = 0; j< arr2.length;j++){
            if(arr1[j] == arr2[j]){
                flag = true;
            }else{
                flag = false;
                break;
            }
        }
        return flag;
    }
}
java 复制代码
package Base_One;
import java.util.Scanner;

public class Base_006 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int arr [] = {19,28,38,46,50};
        int number = sc.nextInt();
        System.out.println(number);
        int index =-1;
        for (int i = 0;i< arr.length;i++){
            if (arr[i] ==number) {
                index = i;
                break;
            }
        }
        if (index == -1){
            System.out.println("输入错误");
        }else{
            System.out.println(index);
        }

    }
} 

或者

java 复制代码
package Base_One;
import java.util.Scanner;

public class Base_006 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int arr [] = {19,28,38,46,50};
        int number = sc.nextInt();
        System.out.println(number);


        int flag=Index(arr,number);
        System.out.println(flag);

    }
    public static int Index(int [] arr,int number){
        int index =-1;
        for (int i = 0;i<arr.length;i++){
            if (number==arr[i]){
                index = i;
                break;
            }
        }
        return index;
    }
}
java 复制代码
package Base_One;

public class Base_006 {
    public static void main(String[] args) {
        int [] arr = {19,28,37,46,50};
        reverse(arr);
        printarr(arr);
    }
    public static void reverse(int [] arr){
        for (int i=0, j = arr.length-1;i<=arr.length/2;i++,j--){
            int temp;
            temp= arr[i];
            arr[i] = arr[j];
            arr[j] = temp;
        }
    }
    public static void printarr(int [] arr){
        System.out.print("[");
        for (int i = 0;i< arr.length;i++){
            if (i != arr.length-1){
                System.out.print(arr[i]+" ");
            }else{
                System.out.print(arr[i]+"]");
            }
        }
    }
}
java 复制代码
package Base_One;
import java.util.Scanner;
public class Base_006 {
    public static void main(String[] args) {
        Scanner sr = new Scanner(System.in);
        System.out.println("输入评委的个数");
        int number = sr.nextInt();
        int[] arr = new int[number];

        for (int i = 0; i < number; i++) {
            arr[i] = sr.nextInt();
        }
        printarr(arr);
        int score = Score(arr);
        System.out.println(score);
    }

    public static void printarr(int[] arr) {
        System.out.print("[");
        for (int i = 0; i < arr.length; i++) {
            if (i != arr.length - 1) {
                System.out.print(arr[i] + " ");
            } else {
                System.out.print(arr[i] + "]");
            }
        }
        System.out.println();
    }

    public static int Score(int [] arr){
        int sum = 0;
        for (int i = 0;i<arr.length;i++){
            sum +=arr[i];
        }
        int min = arr[0];
        int max = arr[0];
        for (int j = 1;j<arr.length;j++){
            if (arr[j]>max){
                max = arr[j];
            } else if (arr[j]<min) {
                min = arr[j];
            }

        }
        sum = sum-min-max;
        sum = sum/(arr.length-2);
        return sum;
    }

}
相关推荐
点心的游戏开发世界7 小时前
GDScript 入门笔记(十一):Lambda 与匿名函数
开发语言·笔记·游戏引擎·godot
phltxy7 小时前
C语言操作符详解
java·c语言·算法
aqiu1111117 小时前
【LeetCode 902】最大为 N 的数字组合 - 详细题解与数位组合思路
数据结构·算法·leetcode·蓝桥杯·数位dp
步行cgn8 小时前
@Configuration 详解:Spring 配置类的核心注解
java·后端·spring
sunshine22 girl8 小时前
Java学习一 环境配置2 安装和基本使用Idea
java·学习·intellij-idea
辰烨chenye8 小时前
LeetCode Hot 100 题解 · 哈希篇
算法·leetcode·哈希算法
事圆则缓9 小时前
Kotlin 协程完全指南
开发语言·kotlin
罗西的思考9 小时前
DreamZero 与 DreamDojo:世界模型与策略的分层协同综合分析与对比
人工智能·算法·机器学习
我爱写代码i9 小时前
BeLink - 支持生成多种URL 缩短网址PHP源码
开发语言·php·短网址php源码