In Java using recursion. No Loops. No main method, just the stutter method pleas

ID: 3764609 • Letter: I

Question

In Java using recursion. No Loops. No main method, just the stutter method please.

Write a method stutter that accepts a Stack of integers as a parameter and replaces every value in the stack with two occurrences of that value. For example, suppose a stack stores these values:

Then the stack should store the following values after the method terminates:

Notice that you must preserve the original order. In the original stack the 9 was at the top and would have been popped first. In the new stack the two 9s would be the first values popped from the stack. Also, you must not use any auxillary data structures to solve this problem. If the original stack is empty, the result should be empty as well.

Explanation / Answer

import java.util.*;
public class doublingstack{

public static Stack<Integer> stutter(Stack st) {
if(st.empty()){
return st;
}
else{
Integer x = (int) st.pop();
Stack st1=stutter(st);
st1.push(x);
st1.push(x);
return st1;
}
}
}

Navigate

In Java using Eclipse, I\'m suppose to write a class that encapsulates a tic tac

In Java using recursion. No Loops. Write a method stutter that accepts a Stack o

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.

In Java using recursion. No Loops. No main method, just the stutter method pleas

Question

Explanation / Answer

Related Questions

Navigate