zoukankan      html  css  js  c++  java
  • 第七次作业

    1.编写一个简单程序,要求数组长度为5,静态赋值10,20,30,40,50,在控制台输出该数组的值。

    package ydy3;

    import java.util.Scanner;

    public class test3{

    public static void main(String[] args) {
    Scanner sc=new Scanner(System.in);

    int[] arr=new int[]{10,20,30,40,50};
    for(int i=0;i<arr.length;i++)
    {
    System.out.println(arr[i]+"");
    }
    }
    }

     2.编写一个简单程序,要求数组长度为5,动态赋值10,20,30,40,50,在控制台输出该数组的值。

    package ydy3;

    import java.util.Scanner;

    public class test3{

    public static void main(String[] args) {
    Scanner sc=new Scanner(System.in);
    int[] a = new int[6];
    for (int i = 1; i < a.length; i++)
    {
    a[i]+=a[i-1]+10;
    System.out.print(a[i] + " ");
    }
    }
    }

     3.编写一个简单程序,定义整型数组,里面的元素是{23,45,22,33,56},求数组元素的和、平均值

    package ydy3;

    import java.util.Scanner;

    public class test3{

    public static void main(String[] args) {
    Scanner sc=new Scanner(System.in);
    int[] a = new int[]{23,45,22,33,56};
    int sum=0,ave=0;
    for (int i = 0; i < a.length; i++)
    {
    sum+=a[i];
    }
    ave=sum/5;
    System.out.println(sum + " " + ave);
    }
    }

    4.在一个有8个整数(18,25,7,36,13,2,89,63)的数组中找出其中最大的数及其下标。

    package ydy3;

    import java.util.Scanner;

    public class test3{

    public static void main(String[] args) {
    Scanner sc=new Scanner(System.in);
    int[] a = new int[] { 18, 25, 7, 36, 13, 2, 89, 63 };
    int max = a[0];
    for (int i = 0; i < a.length; i++) {
    if (max < a[i])
    {
    max = a[i];
    }
    }
    System.out.println("最大值是:" + max);
    int count = 0;
    for (int i = 0; i < a.length; i++) {
    if (a[i] == max) {
    System.out.println("下标值是:" + count);
    }
    count++;
    }
    }
    }

     5. 将一个数组中的元素逆序存放(知识点:数组遍历、数组元素访问)

    package ydy3;

    import java.util.Scanner;

    public class test3{

    public static void main(String[] args) {
    Scanner sc=new Scanner(System.in);
    int [] a = new int [] {4,1,3,5,9,2,1};
    int t;
    for(int i = 0; i < a.length / 2; i ++) {
    t = a[i];
    a[i] = a[a.length - 1 - i];
    a[a.length - 1 - i] = t;
    }
    for(int i = 0; i < a.length; i ++) {
    System.out.print(a[i] + ", ");
    }
    }
    }

  • 相关阅读:
    LeetCode--Array--Two sum (Easy)
    LeetCode--Unique Email Addresses & Hamming Distance (Easy)
    LeetCode--Squares of a Sorted Array && Robot Return to Origin (Easy)
    LeetCode--Sort Array By Parity && N-Repeated Element in Size 2N Array (Easy)
    LeetCode 11月第1周题目汇总
    LeetCode 十月份题目汇总
    【每天一题】LeetCode 172. 阶乘后的零
    【每天一题】LeetCode 121. 买卖股票的最佳时机
    【每天一题】LeetCode 0107. 自底向上层遍历二叉树
    【每天一题】LeetCode 0067. 二进制求和
  • 原文地址:https://www.cnblogs.com/ydy128/p/12665794.html
Copyright © 2011-2022 走看看