package com.shi.cutdemo;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
public class demo {
public static void main(String args[]) {
demo d = new demo();
System.out.println(d.count(6));
System.out.println(d.c(10));
d.a();
}
// n的阶乘
public int count(int n){
int sum=1;
for(int i=1;i<=n;i++){
sum = sum * i;
}
return sum;
}
// n的阶乘+(n-1)的阶乘。。。。
public Long c(int n) {
Long sum= 0L;
Long k = 1L;
for(int j=1;j<=n;j++) {
k=k*j;
System.out.println(j+"的阶乘="+k);
{
sum = sum +k;
}
}
return sum;
}
// 求给定数组的和
public void a() {
Scanner sc = new Scanner(System.in);
int sum = 0;
int max = 0;
Integer[] a = new Integer[10] ;
Integer[] b = new Integer[10];
Integer[] c = new Integer[10];
while(true) {
for(int i=0;i<a.length;i++) {
System.out.println("请输入第"+i+"个数字");
a[i] = sc.nextInt();
}
break;
}
int min= a[1];
for(int i=0;i<a.length;i++) {
sum = sum + a[i];
if(a[i]>max) {
max = a[i];
}
if(min>a[i]) {
min = a[i];
}
}
System.out.println("数组的最小值是min="+min);
System.out.println("数组的最大值是max="+max);
System.out.println("数组和是sum="+sum);
// 数组排序==>冒泡排序
for(int i=0;i<a.length;i++) {
for(int j=0;j<a.length;j++) {
int temp = 0;
if(a[i]>a[j]) {
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
System.out.println("数组排序是"+Arrays.toString(a));
}
}
java阶乘,n阶乘和,排序
最新推荐文章于 2022-05-05 12:10:11 发布