Question

****WRITE A JAVA PROGRAM THAT :

Write a method named stretch that accepts an array of integers (that the user inputs) as a parameter and returns a new array twice as large as the original, replacing every integer from the original array with a pair of integers, each half the original. If a number in the original array is odd, then the first number in the new pair should be one higher than the second so that the sum equals the original number.

For example, if a variable named list refers to an array storing the values {18, 7, 4, 24, 11}, the call of stretch(list) should return a new array containing {9, 9, 4, 3, 2, 2, 12, 12, 6, 5}.

-The number 18 is stretched into the pair 9, 9,

-the number 7 is stretched into 4, 3, (bigger number first)

-the number 4 is stretched into 2, 2,

-the number 24 is stretched into 12, 12

and the number 11 is stretched into 6, 5 (again, the bigger number first)

Be sure to have a stretch() method

*All variable names are completely up to you, as long as they’re descriptive

*Use the correct data types

*Use comments to explain what you’re coding

*Put your name in a comment

******** PLEASE CODE SO THAT I BEGINNER CAN UNDERSTAND

Answer 1

Thanks for the question.

Here is the completed code for this problem. 

Comments are included, go through it, learn how things work and let me know if you have any doubts or if you need anything to change. 

If you are satisfied with the solution, please rate the answer. 

Thanks!
===========================================================================

import java.util.Arrays;

public class TestProgram {


    public static int[] stretch(int[] numbers) {

        // create an array that has size twice that of numbers
        int[] array = new int[numbers.length * 2];

        // create an int variable to track the index of the element in array
        int index = 0;

        // we need to iterate each element in the numbers
        for (int i = 0; i < numbers.length; i++) {
            // check the number is even
            if (numbers[i] % 2 == 0) {
                // half the current number and insert them in the two spots
                // incrementing the index by 1 each time
                array[index++] = numbers[i] / 2;
                array[index++] = numbers[i] / 2;
            } else {
                // for odd case
                int number = numbers[i] / 2; // this will the lower number
                array[index++] = number + 1;
                array[index++] = number;
            }

        }


        // return this array
        return array;
    }

    public static void main(String[] args) {

        int[] numbers = {18, 7, 4, 24, 11};
        System.out.println(Arrays.toString(numbers));
        System.out.println("After strech");
        int[] strechedNumbers = stretch(numbers);
        System.out.println(Arrays.toString(strechedNumbers));
    }
}

======================================================================

1: Proje public static int[] stretch(int[] numbers) { // create an array that has size twice that of numbers int[] array = new int[numbers.length * 2]; // create an int variable to track the index of the element in array int index = 0; // we need to iterate each element in the numbers for (int i = 0; i < humbers.length; i++) { // check the number is even if (numbers[i] : 2 == 0) { // half the current number and insert them in the two spots // incrementing the index by 1 each time array[index++] = numbers[i] / 2; array[index++] = numbers[i] / 2; else { // for odd case int number = numbers[i] / 2; // this will the lover number array[index++] = number + 1; array[index++] = number; 1. Z: Structure Run: + TestProgram > stretch TestProgram x "C:\Program Files\Java\jdk-11\bin\java.exe" "javaagent:C:\Program Files\JetBrains\IntelliJ [18, 7, 4, 24, 11] After strech [9, 9, 4, 3, 2, 2, 12, 12, 6, 5] → * 2: Favorites If Process finished with exit code 0 4 Run 6: TODO Terminal EO: Messages Compilation completed successfully in 2 s 436 ms (a minute ago)