logo Practice-It logo

BJP5 Exercise 16.10: stretch

Related Links:
Author: Marty Stepp (on 2019/09/19)

Write a method stretch that takes an integer n as a parameter and that increases a list of integers by a factor of n by replacing each integer in the original list with n copies of that integer. For example, if a variable called list stores this sequence of values:

[18, 7, 4, 24, 11]

And we make the following call:


The list should store the following values after the method is called:

[18, 18, 18, 7, 7, 7, 4, 4, 4, 24, 24, 24, 11, 11, 11]

If the value of n is less than or equal to 0, the list should be empty after the call.

Assume that you are adding this method to the LinkedIntList class as defined below:

public class LinkedIntList {
    private ListNode front;   // null for an empty list
    // your code goes here
Type your solution here:

This is a partial class problem. Submit code that will become part of an existing Java class as described. You do not need to write the complete class, just the portion described in the problem.

You must log in before you can solve this problem.

Log In

If you do not understand how to solve a problem or why your solution doesn't work, please contact your TA or instructor.
If something seems wrong with the site (errors, slow performance, incorrect problems/tests, etc.), please

Is there a problem? Contact a site administrator.