Question

please check first question before you do this one Java please it's data sturcture classs using java editor netbeans

2.  

3. public static int indexOfLargest(int[] arr) – if arr is null then return -1; otherwise return the index of the largest value. If the largest value appears more than one time, then return the left-most index. Example: If arr = {9, -2, 3, 50, 4, 99, 11, 4, 5, 99, 3, 4, -6}; then the method returns 5 4. public static int[] removeLargest(int[] arr) • if arr is null then return null if arr isn't null then return an array that contains all the values stored in arr except for the largest value; if the largest value appears more than one time, then remove the left-most occurrence; the length of the returned array is arr.length - 1. Reminder: Use System.arraycopy Example: Suppose arr = {9, -2, 3, 50, 4, 99, 11, 4, 5, 99, 3, 4, -6}; The method returns the following array {9, -2, 3, 50, 4, 11, 4, 5, 99, 3, 4, -6};

Answer 1

public static int indexOfLargest(int[] arr){
    if(arr==null){
        return -1;
    }
    else{
        int largestIndex = 0;
        for(int i = 1;i<arr.length;i++){
            if(arr[largestIndex] < arr[i]){
                largestIndex = i;
            }
        }
        return largestIndex;
    }
}

public static int[] removeLargest(int[] arr){
    int largestIndex = indexOfLargest(arr);
    if(largestIndex!=-1){
        int res[] = new int[arr.length-1];
        System.arraycopy(res,0,arr,0,largestIndex);
        System.arraycopy(res,largestIndex,arr,largestIndex+1,res.length-largestIndex);
        return res;
    }
    else{
        return null;
    }
}