The FlipList class defined below is intended to be identical to a list, except that the append method only adds new elements to the back of the list when the length of the list is odd. When the length is even, append should instead add the new element to the front of the list. class FlipList(list): def append(self, item): if len(self) % 2 == 0: self.insert(0, item) else: Fill in the blank with a line of code such that FlipList works as described above.

The FlipList class defined below is intended to be identical to a list, except that the append method only adds new elements to the back of the list when the length of the list is odd. When the length is even, append should instead add the new element to the front of the list. class FlipList(list): def append(self, item): if len(self) % 2 == 0: self.insert(0, item) else: Fill in the blank with a line of code such that FlipList works as described above.

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 18RQ

See similar textbooks

Similar questions

get_points("safe", "loft") // => List(A,A,C,A)get_points("safe", "gate") // => List(A,C,A,C)get_points("safe", "star") // => List(C,A,P,A)get_points("safe", "sums") // => List(C,A,A,P) Create a function called get_points which calculates the returns ,as shown above in the tests, by comparing the second word with the first word. The get_points function should output a list of 4 elements of type Letter.if a letter is present in the first word and in the correct place it should return with a "C". If the letter is present but not in the right place it should be a "P".And if the letter is not in the hidden_word then it should an "A" To do this you need to use the finder function to calculate if all the letters that are present in the first wordex. finder("safe", "loft") -> List(f) using the fix_spot function recursively analyse whether if the letter should be A,C or P. The finder function is a wrapper for the fix_spot function calling the fix_spot function with appropriate…
Given the IntNode class, define the getCount() method in the CustomLinkedList class that returns the number of items in the list not including the head node. Ex: If the list contains: head -> 14 -> 19 -> 4 getCount(headObj) returns 3. Ex: If the list contains: head -> getCount(headObj) returns 0. public class IntNode { private int dataVal; // Node data private IntNode nextNodePtr; // Reference to the next node // Default constructor public IntNode() { dataVal = 0; nextNodePtr = null; } // Constructor public IntNode(int dataInit) { this.dataVal = dataInit; this.nextNodePtr = null; } // Constructor public IntNode(int dataInit, IntNode nextLoc) { this.dataVal = dataInit; this.nextNodePtr = nextLoc; } /* Insert node after this node. Before: this -- next After: this -- node -- next */ public void insertAfter(IntNode nodeLoc) { IntNode tmpNext; tmpNext = this.nextNodePtr;…
Create an addAll method into the LList class given below. the method should add an aray of items to the end of the list. method header: public void addAll(T[] items)
class MyList: # constructor def __init__(self, a): # converting array to list newList = a.tolist() # printing the list print("List is:", newList). Complete.
class Node: def __init__(self, e, n): self.element = e self.next = n class LinkedList: def __init__(self, a): # Design the constructor based on data type of a. If 'a' is built in python list then # Creates a linked list using the values from the given array. head will refer # to the Node that contains the element from a[0] # Else Sets the value of head. head will refer # to the given LinkedList # Hint: Use the type() function to determine the data type of a self.head = None # To Do # Count the number of nodes in the list def countNode(self): # To Do # Print elements in the list def printList(self): # To Do # returns the reference of the Node at the given index. For invalid index return None. def nodeAt(self, idx): # To Do
6. Suppose that we have defined a singly linked list class that contains a list of unique integers in ascending order. Create a method that merges the integers into a new list. Note the additional requirements listed below. Notes: ● . Neither this list nor other list should change. The input lists will contain id's in sorted order. However, they may contain duplicate values. For example, other list might contain id's . You should not create duplicate id's in the list. Important: this list may contain duplicate id's, and other list may also contain duplicate id's. You must ensure that the resulting list does not contain duplicates, even if the input lists do contain duplicates.
Redesign LaptopList class from previous project public class LaptopList { private class LaptopNode //inner class { public String brand; public double price; public LaptopNode next; public LaptopNode(String brand, double price) { // add your code } public String toString() { // add your code } } private LaptopNode head; // head of the linked list public LaptopList(String fname) throws IOException { File file = new File(fname); Scanner scan = new Scanner(file); head = null; while(scan.hasNextLine()) { // scan data // create LaptopNode // call addToHead and addToTail alternatively } } private void addToHead(LaptopNode node) { // add your code } private void addToTail(LaptopNode node) { // add your code } private…
class DoublyLinkedList: def __init__(self): self.head = None def is_empty(self): if self.head == None: return True else: return False def enqueue_front(self, data): new_node = Node(data) new_node.next = self.head if self.head is not None: self.head.prev = new_node self.head = new_node def enqueue_rear(self, data): new_node = Node(data) new_node.next = None if self.head is None: new_node.prev = None self.head = new_node return last = self.head while(last.next is not None): last = last.next last.next = new_node new_node.prev = last return def peek(self): return self.head.data def dequeue_front(self): if self.head is None: return temp = self.head self.head = self.head.next self.head.prev = None return temp.data…
Lab 17 Using a linked list with an iterator Build a class called LinkedListRunner with a main method that instantiates a LinkedList. Add the following strings to the linked list: aaa bbb cc ddd eee fff ggg hhh iii Build a ListIterator and use it to walk sequentially through the linked list using hasNext and next, printing each string that is encountered. When you have printed all the strings in the list, use the hasPrevious and previous methods to walk backwards through the list. Along the way, examine each string and remove all the strings that begin with a vowel. When you arrive at the beginning of the list, use hasNext and next to go forward again, printing out each string that remains in the linked list.
Exercise 2: Create a Book class; where: lo Each book contains the following information: book title, book Author name, barcode (as long integers) and book topic. 6 Implement an appropriate constructor(s) and all necessary get/set methods. Test Book class: lo Create different book objects (at least 5 books) and store them in a LinkedList sorted by book barcode value. Generate a unique random integer value for the barcode. O Iterate through the LinkedList and print out the books' details o Create a second LinkedList object containing a copy of the above LinkedList, but in reverse order
Java language the top half is the class that contains the linked list parts the bottom half is the method i need help setting up should take two parameters "index" and "element" should be an actual method not just LinkedList.set(index, element); please and thank you!
Java Program for a Christmas List - NO GUI ** Please include ULM and comments in the code. ** Minimum requirements are: At least 1 loop An Array or ArrayList At least 3 Java classes Use methods I am trying to make it so that the program will have a menu to choose from that includes: Add Recipient Name Add Gift Idea (prompts for the participant to add the gift idea to from the list of those already entered) Mark Gift as Purchased (allows the user to select the recipient from the list, then select a gift idea from the list entered for that recipient, and mark it as "Done".) Mark Gift as Received (allows the user to select the recipient from the list, then select a gift idea from the list entered for that recipient, and mark it as "Done".) Mark Gift as Wrapped (allows the user to select the recipient from the list, then select a gift idea from the list entered for that recipient, and mark it as "Done".) Delete Gift Idea (prompts for the participant and then the idea selection to…