Write a static method removeDuplicates(Character[] in) that returns a new array of the characters in the given array, but without any duplicate characters. Always keep the first copy of the character and remove subsequent ones. For example, if in contains b, d, a, b, f, a, g, a, a, and f, the method will return an array containing b, d, a, f, and g. (Hint: One way to solve this problem is to create a boolean array of the same size as the given array in and use it to keep track of which characters to keep. The values in the new boolean array will determine the size of the array to return.)
Want to see the full answer?
Check out a sample textbook solutionChapter 7 Solutions
Java: An Introduction to Problem Solving and Programming (8th Edition)
Additional Engineering Textbook Solutions
Objects First with Java: A Practical Introduction Using BlueJ (6th Edition)
Java How To Program (Early Objects)
Starting Out with Java: From Control Structures through Data Structures (3rd Edition)
Problem Solving with C++ (9th Edition)
Web Development and Design Foundations with HTML5 (8th Edition)
Java How to Program, Early Objects (11th Edition) (Deitel: How to Program)
- I need to write a method that will move all of the even values in an array to the front positions, otherwise it should preserve their order. I've written a function that can determine if the value in an element is even, but how can I tell the method to move them to the front AND keep the order of the others? My method looks like this at the moment: //TODO: part f - move all evens to front public static void moveEvensToFront(int[] values) { for (int i = 0; i < values.length; i++){ if(values[i] % 2 == 0){ //swap to front? } } } The questions is from Big Java 6th Edition. E7.10.farrow_forwardIs it true that a method that takes an array as a parameter has access to the original array or just a replica of it?arrow_forwardWrite a static method: public static double intersectionSum(double[] a, double[] b) that takes two double arrays as arguments and returns the sum of the elements the two arrays have in common. In other words, the result should be the sum of every element in the two arrays where a[i] is equal to b[i] for some index i. Note that the two arrays may not be the same length. In these cases, you should only consider the indices that the arrays have in common (the indices of the shorter array). If either (or both) arrays are empty or null, the result should be 0.0. Example 1: intersectionSum({3.0, -4.0, 5.8, 6.75}, {3.0, 2.5, 5.8, 4.95}) è 8.8, since a[0] == b[0] and a[2] == b[2] and 3.0 + 5.8 = 8.8 Example 2: intersectionSum({8.5, 9.75, 1.25}, {3.5, 9.75, 1.25, 8.5, -2.34}) è11.0, since a[1] == b[1] and a[2] == b[2] and 9.75 + 1.25 = 11.0arrow_forward
- Write a method that returns a new array by eliminating theduplicate values in the array using the following method header:public static int[] eliminateDuplicates(int[] list)Write a test program that reads in 10 integers, invokes the method, and displaysthe distinct numbers separated by exactly one space. Here is a sample run of theprogram: Enter 10 numbers: 1 2 3 2 1 6 3 4 5 2 ↵EnterThe distinct numbers are: 1 2 3 6 4 5arrow_forwardWrite a method that returns the smallest element in the array that it takes as a parameter. (In the "main" method,will be encoded in java)arrow_forwardImplement a method named insert. This method should take an array of ints, the index at which a new value should be inserted, and the new value that should be inserted. The function should return a new array populated with the contents of the original array with the given value inserted at the given index. The following sections provide a detailed description of this function: Method signature: static int[] insert (int[] array, int index, int value) Parameters: array The original array of ints. index The location where the value will be inserted. value The value to be inserted. Return value: A new array of ints containing the contents of the original array plus the new value inserted at the given index. Pseudocode: // Create new array one larger than original array Let newArray = a newArray with array.length + 1 elements // Copy elements up to insert point from original array to new array Loop to copy array [0, index) to newArray [0, index) // Place insert value into new array Set…arrow_forward
- Write a method that returns the index of the smallest element in an array of doubles. The method should receive an array for formal parameters.arrow_forwardWrite a method that returns the index of the smallest element in an array of doubles. The method should receive an array for formal parameters. (in Java)arrow_forward3. Remove an element from an array Consider an array named source. Write a method/function named remove( source, size, idx) that removes the element in index idx of the source array. You must execute the method by passing an array, its size and the idx( that is the index of the element to be removed). After calling the method, print the array to show whether the element of that particular index has been removed properly. Example: source=[10,20,30,40,50,0,0] remove(source,5,2) After calling remove(source,5,2) , printing the array should give the output as: [ 10,20,40,50,0,0,0] Use Python languagearrow_forward
- 3. Remove an element from an array Consider an array named source. Write a method/function named remove( source, size, idx) that removes the element in index idx of the source array. You must execute the method by passing an array, its size and the idx( that is the index of the element to be removed). After calling the method, print the array to show whether the element of that particular index has been removed properly. Example: source=[10,20,30,40,50,0,0] remove(source,5,2) After calling remove(source,5,2) , printing the array should give the output as: [ 10,20,40,50,0,0,0] [Use Python and Don't use Built-in function like "pop"]arrow_forwardWrite a java method that receives two integer Arrays called A and B sorted in ascending order then returns the Array called res contains prime elements from A and B sorted in descending order. Note: Do not use methods from the Arrays class.arrow_forwardWrite a method that sums the areas of all thegeometric objects in an array. The method signature is:public static double sumArea(GeometricObject[] a)Write a test program that creates an array of four objects (two circles and tworectangles) and computes their total area using the sumArea method.arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education