数组/排序,插入,查找,平均值,最值

package practice;
import java.util.*;
import static java.lang.System.*;
/**
 *
 * @author Zhu Zhengyan
 */
public class practice1 {
    public static void main(String[] args)
    {
        out.println("The length of the array");
        shuzu m = new shuzu();
        out.print("They are");
        m.show();
        out.print("The average is:");
        m.average();
        m.zuizhi();
        out.println("sort them");
        m.paixu(2.0);
        out.println("输入他们中的一个数求其位置");
        m.search();
        out.println("插入一个数到哪个位置");
        out.println("插入哪个数");
        m.charu();
    }
}
class shuzu
{
    Scanner in = new Scanner(System.in);
    private double []shu = new double[in.nextInt()];
    private double a ;
    private double s = 0;
   public shuzu()
    {
        out.println("Please enter them");
        for(int i = 0;i<shu.length;i++)
        {
            a = in.nextDouble();
            shu[i] = a;
        }
    }
    public void average()
    {
        for(int i = 0;i<shu.length;i++)
        {
           s += shu[i];
        }
        out.println(s/shu.length);
    }
    public void show()
    {
        String o = Arrays.toString(shu);
        out.println(o);
    }
    public void zuizhi()
    {
        Arrays.sort(shu);
        out.print("The max is :");
        out.println(shu[shu.length-1]);
        out.print("The min is :");
        out.println(shu[0]);
    }
    public void paixu(double u)
    {
        double a[] = this.shu;
        Arrays.sort(a);
        out.println(Arrays.toString(a));
    }
    public void paixu(int u)
    {
        double a[] = this.shu;
        Arrays.sort(a);
        out.println(Arrays.toString(a));
    }
    public void search()
    {
        double u = in.nextDouble();
        for(int i = 0;i<shu.length;i++)
        {
            if(shu[i] == u)
                out.println("位置:"+i);
        }
    }
    public void charu()
    {
        double t = 0;
        int i = in.nextInt();
        double x = in.nextDouble();
        double newshu[] = Arrays.copyOf(this.shu,this.shu.length+1);
        for(int j = newshu.length-1;j>=i;j--)
        {
            newshu[j] = newshu[j-1];
        }
        newshu[i] = x;
        out.println("They are:");
        out.println(Arrays.toString(newshu));
    }
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值