How do you do this? JAVA NextDescriptionWrite a static method called removeMatches that removesextra copies of a value that are adjacent to it in an ArrayListof Integer objects. For example, if a variable called listcontains the following:[1, 3, 3, 3, 3, 15, 2, 2, 1, 19, 3, 42, 42, 42, 7, 42, 1]and we make the following call:remove Matches (list);Then list should store the following values after the call:[1, 3, 15, 2, 1, 19, 3, 42, 7, 42, 1]Notice that the four bccurrences of 3 that appear next to eachother have been replaced with a single occurrence of 3, thetwo occurrences of 2 that appear next to each other have beenreplaced with a single 2, and the three occurrences of 42 thatappear next to each other have been replaced with a single 42.Notice, however, that the list still contains three occurrences of1, two occurrences of 3, and two occurrences of 42. That isbecause those duplicate values do not appear right next toeach other in the list.You may not construct any extra data structures to solve thisproblem. You must solve it by manipulating the ArrayListyou are passed as a parameter. +RemoveMatches.java1 import java.util.*;23 public class RemoveMatches {456public static void main(String[] args) {Integer [] test1 = {1, 3, 3, 3, 3, 15, 2, 2, 1, 19, 3, 42, 42, 42, 7, 42, 1};ArrayList list = new ArrayList (Arrays.asList (test1));System.out.println("Before:" + list);removeMatches (list);System.out.println("After : " + list);

Program Code: // Java Program to Remove Duplicate Elements// From the Array using extra space public…

Write a static method called removeMatches that removes extra copies of a value that are adjacent to it in an ArrayList of Integer objects. For example, if a variable called list contains the following: [1, 3, 3, 3, 3, 15, 2, 2, 1, 19, 3, 42, 42, 42, 7, 42, 1] and we make the following call: removeMatches (list); Then list should store the following values after the call: [1, 3, 15, 2, 1, 19, 3, 42, 7, 42, 1]

Write a static method called removeMatches that removes extra copies of a value that are adjacent to it in an ArrayList of Integer objects. For example, if a variable called list contains the following: [1, 3, 3, 3, 3, 15, 2, 2, 1, 19, 3, 42, 42, 42, 7, 42, 1] and we make the following call: removeMatches (list); Then list should store the following values after the call: [1, 3, 15, 2, 1, 19, 3, 42, 7, 42, 1]

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

Project Description: In this project you implement an ArrayStack ADT and use the stack for implementing the following methods: a) Reverse an array of Words: Accept an array of words as input parameter and return an array of words in reverse order. Use the method signature: public static String[] reverse Words (String[] wordList) Example Input: Bird Cat Dog Elephant Output: Elephant Dog Cat Bird
Project Description: In this project you implement an ArrayStack ADT and use the stack for implementing the following methods: a) Reverse an array of Words: Accept an array of words as input parameter and return an array of words in reverse order. Use the method signature: public static String[] reverseWords (String[] wordList) Example Input: Bird Cat Dog Elephant Output: Elephant Dog Cat Bird
Write the following method that returns themaximum value in an ArrayList of integers. The method returns null if thelist is null or the list size is 0.public static Integer max(ArrayList<Integer> list)Write a test program that prompts the user to enter a sequence of numbers endingwith 0 and invokes this method to return the largest number in the input.
public static ArrayList findExactString(String s, ArrayList myArray) { return null; } // Use the above method, findExactString, as a helper method to implement addWithoutDuplication method. The addWithoutDuplication method has the following properties: 1- It takes two arguments, a string s and an ArrayList myArray of type string. 2- It returns an integer which represents the number of occurrences of the string s in myArray while attempting to add it. 3- If myArray is null, it returns -1 4- If adds the string s to the end of the ArrayList myArray if the string s is not already there. public static int addwithout Duplication(String s, ArrayList myArray) { return -1;
If N represents the number of elements in the collection, then the contains method of the ArrayCollection class is O(1). True or False If N represents the number of elements in the list, then the index-based add method of the ABList class is O(N). True or False
getListRowIndices Method public static java.util.ArrayList<java.lang.Integer> getListRowIndices(int[][] array, int rowLength) This method returns an ArrayList with the indices of rows of the two-dimensional having a length that corresponds to rowLength. You may only use one auxiliary method. The method should create an ArrayList that is passed to the auxiliary in order to place the indices (if any). If no indices are found, an empty (size of 0) ArrayList will be returned. You can assume the array parameter will not be null and every row of the two-dimensional array has an array with a size of at least 0. Your implementation must be recursive and you may not use any loop construct. Do not use ++ or -- in any recursive call argument. It may lead to an infinite recursion. For example, use index + 1, instead of index++. Parameters: array - rowLength - Returns: ArrayList<Integer>
java Create a static method that: is called combineAL returns an ArrayList<Integer> takes two parameters: an ArrayList of numbers called numbersOne, and another ArrayList of numbers called numbersTwo This method should create a new ArrayList of Integer, add all the numbers (in order) from numbersOne, then add all the numbers (in order) from numbersTwo. In other words, it is combining all the elements from the two lists. public static void main(String[] args) { Scanner in = new Scanner(System.in); int size = in.nextInt(); int size2 = in.nextInt(); ArrayList<Integer> list = new ArrayList<>(); ArrayList<Integer> list2 = new ArrayList<>(); for(int i=0; i < size; i++) { list.add(in.nextInt()); } for(int i=0; i < size2; i++) { list2.add(in.nextInt()); } System.out.println(combineAL(list, list2));
Write the following method that shuffles an ArrayList:public static <E> void shuffle(ArrayList<E> list)
Suppose that you want an operation for the ADT list that adds an array of items to the end of the list. The header of the method could be as follows: public void addAll( T[ ] items) Write an implementation of this method for the class LinearLinkedList
Write the following method that returns an ArrayList from a set:public static <E> ArrayList<E> setToList(Set<E> s)
Computer Science create a method +addToList(o:E):void that adds the object (o) to the ArrayList referenced by the instance variable list. create a method +removeFromBackOfList():E that removes the object at the back of the ArrayList and returns it.
java Create a static method that: is called removeAll returns ArrayList<String> takes two parameters: an ArrayList of Strings called wordList, and a String called targetWord This method should go through every element of wordList and remove every instance of targetWord from the ArrayList. Example: ArrayList<String> wordList = new ArrayList<String>(Arrays.asList("hi","hey","hi","yo")); removeAll(wordList,"hi"); wordList: ["hey","yo"] public static void main(String[] args) { Scanner in = new Scanner(System.in); int size = in.nextInt(); String target = in.next(); ArrayList<String> list = new ArrayList<>(); for(int i=0; i < size; i++) { list.add(in.next()); } System.out.println(removeAll(list, target)); } }