出于某种原因,当我尝试仅打印一个值(即 11.3)时,此代码会打印数组中最高值的三个值。有人可以向我解释一下为什么这样做吗?
import java.util.Scanner;
public class Slide24
{
public static void main (String [] args)
{
Scanner in = new Scanner(System.in);
double[] decMax = {-2.8, -8.8, 2.3, 7.9, 4.1, -1.4, 11.3, 10.4,
8.9, 8.1, 5.8, 5.9, 7.8, 4.9, 5.7, -0.9, -0.4, 7.3, 8.3, 6.5, 9.2,
3.5, 3, 1.1, 6.5, 5.1, -1.2, -5.1, 2, 5.2, 2.1};
double total = 0, avgMax = 0;
for (int counter = 0; counter < decMax.length; counter++)
{
total += decMax[counter];
}
avgMax = total / decMax.length;
System.out.printf("%s %2.2f\n", "The average maximum temperature for December was: ", avgMax);
//finds the highest value
double max = decMax[0];
for (int counter = 1; counter < decMax.length; counter++)
{
if (decMax[counter] > max)
{
max = decMax[counter];
System.out.println("The highest maximum for the December is: " + max);
}
}
}
}
每次找到高于当前最大值的数字时,它都会打印出一个数字(在您的情况下,这种情况发生了三次。)将打印移到 for 循环之外,您应该会很好。
for (int counter = 1; counter < decMax.length; counter++)
{
if (decMax[counter] > max)
{
max = decMax[counter];
}
}
System.out.println("The highest maximum for the December is: " + max);
要从数组中查找最高(最大值)或最低(最小值)值,这可以为您提供正确的方向。这是从原始数组中获取最高值的示例代码。
public int maxValue(int array[]){
List<Integer> list = new ArrayList<Integer>();
for (int i = 0; i < array.length; i++) {
list.add(array[i]);
}
return Collections.max(list);
}
要获取最小值,可以使用
Collections.min(list)
public int maxValue(int array[]){
int max = Arrays.stream(array).max().getAsInt();
return max;
}
现在以下行应该可以工作了。
System.out.println("12月的最高最大值是:" + maxValue(decMax));
扫描完所有内容后您需要打印出最大值:
for (int counter = 1; counter < decMax.length; counter++)
{
if (decMax[counter] > max)
{
max = decMax[counter];
// not here: System.out.println("The highest maximum for the December is: " + max);
}
}
System.out.println("The highest maximum for the December is: " + max);
https://docs.oracle.com/javase/7/docs/ api/java/util/Collections.html),操作范围包括求最大值、最小值、排序、倒序等
使用集合从数组中查找最大值的简单方法:
Double[] decMax = {-2.8, -8.8, 2.3, 7.9, 4.1, -1.4, 11.3, 10.4, 8.9, 8.1, 5.8, 5.9, 7.8, 4.9, 5.7, -0.9, -0.4, 7.3, 8.3, 6.5, 9.2, 3.5, 3.0, 1.1, 6.5, 5.1, -1.2, -5.1, 2.0, 5.2, 2.1};
List<Double> a = new ArrayList<Double>(Arrays.asList(decMax));
System.out.println("The highest maximum for the December is: " + Collections.max(a));
如果您有兴趣寻找最小值,类似于寻找最大值:
System.out.println(Collections.min(a));
对列表进行排序的最简单行:
Collections.sort(a);
或者使用 Arrays 类对数组进行排序:
Arrays.sort(decMax);
但是 Arrays 类没有直接引用最大值的方法,对其进行排序并引用最后一个索引就是最大值,但是请记住,通过上述 2 个方法排序的复杂度为 O(n log n ).
int max = decMax[0];
for(int i=1;i<decMax.length;i++)
max = Math.max(decMax[i],max);
System.out.println("The Maximum value is : " + max);
double max = Arrays.stream(decMax).max(Double::compareTo).get();
print() 语句位于 for()
循环中,它应该位于之后,以便只打印一次。目前的方式是,每次最大值更改时都会打印
max
。
最简单的方法
public class Test {
public static void main(String[] args) {
double[] decMax = {-2.8, -8.8, 2.3, 7.9, 4.1, -1.4, 11.3, 10.4,
8.9, 8.1, 5.8, 5.9, 7.8, 4.9, 5.7, -0.9, -0.4, 7.3, 8.3, 6.5, 9.2,
3.5, 3, 1.1, 6.5, 5.1, -1.2, -5.1, 2, 5.2, 2.1};
double maxx = decMax[0];
for (int i = 0; i < decMax.length; i++) {
if (maxx < decMax[i]) {
maxx = decMax[i];
}
}
System.out.println(maxx);
}
}
public static <T extends Comparable<T>> T findMax(T[] array){
T max = array[0];
for(T data: array){
if(data.compareTo(max)>0)
max =data;
}
return max;
}
你可以这样写。
import java.util.Scanner;
class BigNoArray{
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
System.out.println("Enter how many array element");
int n=sc.nextInt();
int[] ar= new int[n];
System.out.println("enter "+n+" values");
for(int i=0;i<ar.length;i++){
ar[i]=sc.nextInt();
}
int fbig=ar[0];
int sbig=ar[1];
int tbig=ar[3];
for(int i=1;i<ar.length;i++){
if(fbig<ar[i]){
sbig=fbig;
fbig=ar[i];
}
else if(sbig<ar[i]&&ar[i]!=fbig){
sbig=ar[i];
}
else if(tbig<ar[i]&&ar[i]!=fbig){
tbig=ar[i];
}
}
System.out.println("first big number is "+fbig);
System.out.println("second big number is "+sbig);
System.out.println("third big number is "+tbig);
}
}
void FindMax()
{
int lessonNum;
System.out.print("Enter your lesson numbers : ");
lessonNum = input.nextInt();
int[] numbers = new int[lessonNum];
for (int i = 0; i < numbers.length; i++)
{
System.out.print("Please enter " + (i + 1) + " number : ");
numbers[i] = input.nextInt();
}
double max = numbers[0];
for (int i = 1; i < numbers.length; i++)
{
if (numbers[i] > max)
{
max = numbers[i];
}
}
System.out.println("Maximum number is : " + max);
}
double max = decMax[0];
for (int counter = 1; counter < decMax.length; counter++){
if(max<decMax[i]){
max=decMax[i]; //swapping
decMax[i]=decMax[0];
}
}
System.out.println("The max value is "+ max);
希望这对你有帮助
Arrays.sort(series1Numbers);
int maxSeries = Integer.parseInt(String.valueOf(series1Numbers[series1Numbers.length-1]));
public void findHighestNoInArray() {
int[] a = {1,2,6,8,9};
int large = a[0];
for(int num : a) {
if(large < num) {
large = num;
}
}
System.out.println("Large number is "+large+"");
}
import java.util.*;
class main9 //Find the smallest and 2lagest and ascending and descending order of elements in array//
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter the array range");
int no=sc.nextInt();
System.out.println("Enter the array element");
int a[]=new int[no];
int i;
for(i=0;i<no;i++)
{
a[i]=sc.nextInt();
}
Arrays.sort(a);
int s=a[0];
int l=a[a.length-1];
int m=a[a.length-2];
System.out.println("Smallest no is="+s);
System.out.println("lagest 2 numbers are=");
System.out.println(l);
System.out.println(m);
System.out.println("Array in ascending:");
for(i=0;i<no;i++)
{
System.out.println(a[i]);
}
System.out.println("Array in descending:");
for(i=a.length-1;i>=0;i--)
{
System.out.println(a[i]);
}
}
}
int arr[] = {10, 11, 12, 13, 55, 18, 20};
int num = arr.length;
int max = 0;
for (int i = 0; i < num; i++) {
if (arr[i] > max) {
max = arr[i];
}
}
System.out.println(max);
package Loops;
import java.util.Scanner;
public class LargestNumber {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("How many numbers you want to enter?\n");
int x = sc.nextInt();
int[] data = new int[x];
for (int i = 0; i < data.length; i++) {
System.out.println("Enter the number " + (i + 1));
data[i] = sc.nextInt();
}
int max = data[0];
int min = data[0];
int i;
for (i = 1; i < data.length; i++) {
if (data[i] > max) {
max = data[i];
} else if (data[i] < min) {
min = data[i];
}
}
System.out.println("The highest number in array is: " + max);
System.out.println("The smallest number in array is: " + min);
}
}
int[] data2 = {1,10,50,70};
List<Integer> testing= new ArrayList<>();
for(int s=0;s<data.length;s++){
testing.add(data[s]);
}
int t= Collections.max(testing);
int mini= Collections.min(testing);
System.out.println("Max is:"+t);
System.out.println("Minimum is:"+mini);
function maxElement(values){
var max = values[0]; // Initialize maximum element
for (value of values){ //Traverse array elements from second and compare every element with curr`enter code here`ent max
if (value > max) {
max = value //new maximum
}
}
return max;
}