java循环实现求最小数最大数

Question

如题所述

Answer 1

public static void main(String[] args) {
int[] a = {2,3,14,1,6,1,2,8,4};
int MaxNumber = 0;
int MinNumber = 100;
for (int i = 0; i < a.length; i++) {
MaxNumber = Math.max(a[i], MaxNumber);
MinNumber = Math.min(a[i], MinNumber);
}
System.out.println("最大数是："+MaxNumber+"\t最小数是："+MinNumber);
}
简单明了，用我的吧! ^_^

Answer 2

int[] score = {1,2,4,6,3,2};
int max = score[0];
for(int i =0 ; i<score.length; i++){
if(score[i] > max){
max = score[i];
}
}

System.out.println(“最高成绩是：”+max);

同理可得最小值

Answer 3

import java.util.*;
public class IntArrayNumber{
public static int maxNumber(int[] array){
int max = array[0];
for(int i = 1; i < array.length; i++){
if(max < array[i]){
max = array[i];
}
}
return max;
}

public static int minNumber(int[] array){
int min = array[0];
for(int i = 1; i < array.length; i++){
if(min > array[i]){
min = array[i];
}
}
return min;
}

public static int avgNumber(int[] array){
int sum = array[0];
for(int i = 1; i < array.length; i++){
sum += array[i];
}
return sum / array.length;
}

public static void reverseArray(int[] array){
int temp = 0;
for(int i = 0; i < array.length / 2; i++){
temp = array[i];
array[i] = array[array.length - i -1];
array[array.length - i -1] = temp;
}
}

static void sortArrayASC(int[] numbers){
int temp = 0;
for(int i = 0; i < numbers.length - 1; i++){
for(int j = 0; j < numbers.length - i - 1; j++){
if(numbers[j] > numbers[j + 1]){
temp = numbers[j];
numbers[j] = numbers[j + 1];
numbers[j + 1] = temp;
}
}
}
}

static void sortArrayDESC(int[] numbers){
int temp = 0;
for(int i = 0; i < numbers.length - 1; i++){
for(int j = 0; j < numbers.length - i - 1; j++){
if(numbers[j] < numbers[j + 1]){
temp = numbers[j];
numbers[j] = numbers[j + 1];
numbers[j + 1] = temp;
}
}
}
}

static void printArray(int[] numbers){
for(int i = 0; i < numbers.length; i++){
System.out.print(numbers[i] + "\t");
}
}

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

System.out.print("从键盘上读取数组的大小");
int[] numbers;
numbers = new int[input.nextInt()];

System.out.println();

for(int i = 0; i < numbers.length; i++){
System.out.print("从键盘上读取数组中第" + (i + 1) + "个数");
numbers[i] = input.nextInt();
}
System.out.print("\n数组原始顺序：");
printArray(numbers);

System.out.print("\n\n最大值：" + maxNumber(numbers));
System.out.print("\t最小值：" + minNumber(numbers));
System.out.println("\t平均值：" + avgNumber(numbers));

System.out.print("\n逆序输出：");
reverseArray(numbers);
printArray(numbers);

System.out.print("\n\n升序排序：");
sortArrayASC(numbers);
printArray(numbers);

System.out.print("\n\n逆序排序：");
sortArrayDESC(numbers);
printArray(numbers);

System.out.println();
}
}

Answer 4

排序呗，排完序取第一个和最后一个

Answer 5

//冒泡排序
public static void BubbleSort(int[] pData,int Count)
{
int iTemp;
for(int i=1;i<Count;i++)
{
for(int j=Count-1;j>=i;j--)
{
if(pData[j]<pData[j-1])//两数比较后，大的放后面
{
iTemp = pData[j-1];
pData[j-1] = pData[j];
pData[j] = iTemp;
}
}
}
}

public static void main(String[] args) {
//例子,6个数比较大小
int [] pData ={1,22,5,99,10,33};
//调用冒泡排序方法排序，数组由大到小排序
BubbleSort(pData,6);
//打印数组
for (int i = 0; i < pData.length; i++) {
if (i==0) {
System.out.println("min:"+pData[i]);
}else if (i==pData.length-1) {
System.out.println("max:"+pData[i]);
}else{
System.out.println(pData[i]);
}
}
}
希望能给你帮助