In Java, please write the COMPLETE code for the prompt in the following TWO pict

Question

In Java, please write the COMPLETE code for the prompt in the following TWO pictures.

-Please write the program as simply as possible.

-Please read and follow the prompt closely

-THE STEP-BY-STEP INPUT/OUTPUT OF THE PROGRAM IS LOCATED IN THE FIRST PICTURE (1 - 9)! Once again, READ THE PICTURES! This is what I mean by "Read and follow the prompt closely"! Everything you need to know is in the pictures! Please don't ask me to update the question if you haven't read the pictures!

-Your program should run.

-Your program MUST implement and use STACK class methods. That means there must be peek(), push(), pop(), and remove() methods that interact with the stack.

-We have not learned hashmap yet, so please DONT use hashmap.

-DO NOT USE COLLECTIONS.

-MUST use a separate class to represent Objects for Stack.

-MUST search through Stack at some point.

All of the details of the program can be found in the following pictures. PLEASE DON'T WASTE MY QUESTION ALLOWANCE WITH PARTIAL CODE OR CODE THAT DOES NOT FOLLOW THESE DIRECTIONS. This is the 6th time posting this question and I'm running out!

THANK YOU!

For a variety of reasons, human beings track the food they intake. Assume you are working for a healthcare analytics company, and need to gather information about the eating habits of your clients. You need to create a software that helps in doing your work. For this purpose, you write a meni driven program with the following options: 1. Register client and crcatc clicnt login (clicnt supplics the clicntID and password, and thc clientID must be unique) 2. Login existing client 3. Add a food item client ate 4. Check the complete history of food a client ate in a day in reverse order (all food items listed here from dinner to breakfast) 5. Check all the different types of food items a client ate in a day (all food items listed here only once) 6. Total calories eaten in a day 7. Food with the maximum calorie in a day 8. Food that the client ate maximum number of times in a day 9. Logout

Explanation / Answer

public class StackReviseDemo { public static void main(String[] args) { LinkedList newStack = new LinkedList(); newStack.push(10); newStack.push(1); newStack.push(50); newStack.push(20); newStack.push(90); display(newStack); newStack.pop(); newStack.pop(); newStack.pop(); newStack.pop(); display(newStack); } private static void display(LinkedList newStack) { boolean first = true; LinkedList reversedStack = new LinkedList(newStack); Collections.reverse(reversedStack); for (Integer integer : reversedStack) { if (first) first = false; else System.out.print(" "); System.out.print(integer); } System.out.println(); } }

Related Questions

Navigate

• Browse (All)
• Browse I
• Subjects

---

---

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