刪除陣列中的兩個最大元素

Question

我可以填充我的數組，並找到兩個最大的數字。但是，我不能刪除它。可能你們可以幫我嗎？

int n = sc.nextInt(); 
    int [] myArray = new int[n]; 
    int first = 0; 
    int second = 0; 
     for(int i = 0; i < myArray.length; i++) { 
    int num = sc.nextInt();` 
     if (num > first) { 
     second = first; 
     first = num; 
    } else if(num > second) 
     { 
     second = num; 
     } 
    } 

    System.out.println("The largest " + first+ "The second largest " + second); 

Answer 1

您可以簡單地對數組進行排序並查找或刪除兩個最大的元素。

int [] myArray = new int[]{14,5,2,16,18,20}; 
System.out.println("The original array is "+ " " +Arrays.toString(myArray)); 
Arrays.sort(myArray); 
System.out.println("The sorted array is "+ " " +Arrays.toString(myArray));; 

int fisrtmax = myArray[myArray.length-1]; 
int secondmax = myArray[myArray.length-2]; 

System.out.println("The first biggest number is " + fisrtmax+ " The second biggest number is " + secondmax); 

int [] arrafterremove= Arrays.copyOf(myArray, myArray.length-2); 


System.out.println("The array after removing the two biggest numbers is " + Arrays.toString(arrafterremove)); 

RUN

The original array is [14, 5, 2, 16, 18, 20] 
The sorted array is [2, 5, 14, 16, 18, 20] 
The first biggest number is 20 The second biggest number is 18 
Array after removing the two biggest numbers is [2, 5, 14, 16] 

Answer 2

您可以創建在其中存儲myArray但兩個最大的所有元素的數組（在這種情況下，filteredArray）。 此外，最好保存兩個最大數字的索引而不是它們的值，以便能夠更輕鬆地將其過濾掉。

這應該工作（你會發現你想要的陣列在filteredArray）。

int n = sc.nextInt(); 
int [] myArray = new int[n]; 
int first = 0; 
int second = 0; 
for(int i = 0; i < myArray.length; i++) { 
    myArray[i] = sc.nextInt(); 
    if (myArray[i] > myArray[first]) { 
     second = first; 
     first = i; 
    } else if(myArray[i] > myArray[second]) { 
     second = i; 
    } 
} 
int [] filteredArray = new int[n-2]; 
int skipped = 0; 
for(int i = 0; i < myArray.length; i++) { 
    if(i != first && i != second) 
     filteredArray[i - skipped] = myArray[i]; 
    else 
     skipped++; 
} 

Answer 3

可能是下面的代碼對您有用

again : 
for (int i = 0; i < n; i++) 
{    
    if ((a[i] < a[i+1]) && (i+1)<n) 
    { 
     temp = a[i]; 
     a[i] = a[i+1]; 
     a[i+1] = temp; 
     continue again; 
    }   
} 
System.out.println("The largest " + a[0] + " & second largest " + a[i]); 

如果你想刪除其他然後你可以做到這一點

for(int i=2; i<n ; i++) 
    test = ArrayUtils.remove(a, i); 

Answer 4

如果您使用的是Java 8，你可以整理你的數組，然後你可以循環拋出你的數組，並將其值設置爲另一個避免最後兩個整數例如：

//Your array 
Integer[] array = {8, 99, 6, 336, 2}; 

//sort your array this can give your [2, 6, 8, 99, 336] 
Arrays.sort(array); 

//create a new array with the length = array - 2 if the length of array < 2 then 0 
Integer[] array2 = new Integer[array.length > 2 ? array.length - 2 : 0]; 

//copy your array into the array2 avoiding the 2 last 
System.arraycopy(array, 0, array2, 0, array.length > 2 ? array.length - 2 : 0); 

//print your array, this will print [2, 6, 8] 
System.out.println(Arrays.toString(array2)); 

Answer 5

排序您的數組（默認排序是升序，即從最小到最大），然後創建一個沒有最後兩個元素的數組的新副本。

if(myArray.length > 2) { 
    Arrays.sort(myArray); 
    myArray = Arrays.copyOf(myArray, myArray.length-2); 
} else { 
    throw new IllegalArgumentException("Need moar elements in array!"); 
} 

然後對結果數組執行任何計算。如果您想保留原始陣列，請在執行copyOf()時不要覆蓋myArray。