Question

please answer 1-5

Section 4. Write the following programs. (34 points) 1. (7 points) Define a class called MyLinkedQueue containing two data field: head and tail. Create constructors, setters and getters as appropriate. 2. (7 points) Define an inner class called Queue Node inside MyLinkedQueue containing necessary data fields, and constructors, to make sure the queue can move back and forth. 3. (10 points) Implement the poll and offer methods for the MyLinkedQueue class. 4. (5 points) Implement the isPalindrome method to the MyLinkedQueue class to check if the queue going forward is identical to the queue going backwards. For example, Queue {1,2,3,2,1) is Palindrome. 5. (5 points) Given an ArrayList of integers, return indices of the two numbers such that they add up to a specific target. For example, Given nums = [2, 7, 11, 15), target=9, Because nums[0] + nums[1] = 2 + 7 = 9, return (0,1).

Answer 1

1) MyLinkedQueue --- I have created the MyLInkedQueue class in eclipse please refer below

public class MyLinkedQueue {

private int head;
private int tail;

public MyLinkedQueue(int head, int tail) {
   super();
   this.head = head;
   this.tail = tail;
}

public int getHead() {
   return head;
}

public void setHead(int head) {
   this.head = head;
}

public int getTail() {
   return tail;
}

public void setTail(int tail) {
   this.tail = tail;
}
}

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

2)  

public class MyLinkedQueue {

private QueueNode head;
private QueueNode tail;

private class QueueNode { // inner class started
       private int data;
       private QueueNode next;
       private QueueNode previous;

       public QueueNode (int data) {
           this.data = data;
       }
   } // Inner class ended

public MyLinkedQueue(int head, int tail) {
   super();
   this.head = head;
   this.tail = tail;
}

public int getHead() {
   return head;
}

public void setHead(int head) {
   this.head = head;
}

public int getTail() {
   return tail;
}

public void setTail(int tail) {
   this.tail = tail;
}
}

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

3)

public class MyLinkedQueue{

    public static void main(String args[])

    {

        MyLinkedQueue<String> queue = new MyLinkedQueue<String>();   // Creating an empty MyLinkedQueue

        queue.offer("The");   // Inserting using offer()

        queue.offer("Priority");

        queue.offer("Class");

System.out.println("MyLinkedQueue after Insertion: " + queue); // Displaying the final Queue

MyLinkedQueue<Integer> Q = new LinkedList<Integer>(); // create object of Queue

Q.add(423);   // Add numbers to end of Queue

        Q.add(3432);

System.out.println("Queue: " + Q);   // print queue

System.out.println("Queue's head: " + Q.poll());   // print head and deletes the head

System.out.println("Queue's head: " + Q.poll());    // print head and deleted the head

    }

}