Question

23.1 Append to Oversize Array

Java Help

Given an oversize array with size1 elements and a second oversize array with size2 elements, write a method that returns the first array with the elements of the second appended to the end. If the capacity of the oversize array is not large enough to append all of the elements, append as many as will fit.

Hint: Do not construct a new array. Instead, modify the contents of the oversize array inside the method.

Code//

import java.util.Arrays;
import java.util.Scanner;

public class AppendOversize
{

   public static void main(String[] args)
   {
       // Do not edit this method
       Scanner keyboard = new Scanner(System.in);
       final int SIZE = 20;
       int[] array = new int[SIZE];
       int[] append = new int[SIZE];
      
       // Read in the first array
       int value = keyboard.nextInt(); // priming read
       int index;
       for(index=0; index<array.length && value != -1; ++index)
       {
           array[index] = value;
           value = keyboard.nextInt(); // priming read
       }
       keyboard.nextLine(); // get the carriage return out of there
      
       // Get the size from the number of values put in the first array
       int arraySize = index;
      
       // Read in the second array
       value = keyboard.nextInt(); // priming read
       for (index=0; index<append.length && value != -1; ++index)
       {
           append[index] = value;
           value = keyboard.nextInt(); // priming read
       }
       int appendSize = index;
      
       arraySize = appendOversize(array, arraySize, append, appendSize);
       System.out.println("Array is " + Arrays.toString(array) + " size is " + arraySize);
       keyboard.close();
   }
  
   public static int appendOversize(int[] array, int size, int[] toAppend, int toAppendSize)
   {
      
       // Put your code here

      
       return 0; // edit this line

}

Answer 1

THE FUNCTION IS BELOW:-

public static int appendOversize(int[] array, int size, int[] toAppend, int toAppendSize) {

        if (size == array.length) { // if the size parameter is equal to the length of the array

            return size; // that means the array is full and therefore returning that size

        } else {

            int i = 0;

            while (size < array.length && i < toAppendSize) { // else

                array[size++] = toAppend[i++]; // untill the array is less than the length

                                  // append array is not appended to the full the array will be appended

            }

        }

        return size;

    }

public static int appendoversize(int[] array, int size, int[] toAppend, int toAppendSize) {/ if (size == array.length) { // if the size parameter is equal to the length of the array return size; // that means the array is full and therefore returning that size } else { int i = 0; while (size < array.length && i < toAppendSize) { // else array[size+] = toAppend[i++]; // untill the array is less than the length // append array is not appended to the full the array will be appended return size;

PS E:\java> javac text.java PS E:\java> java text.java 1 2 3 4 5 6 7 8 9 10 99 -1 11 12 13 45 56 6 5 65 21 65 -1 Array is [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 99, 11, 12, 13, 45, 56, 6, 5, 65, 21] size is 20 PS E: java> |

FOR ANY OTHER QUERY PLEASE COMMENT.