Please help me make a program C to remove the repeats from the array

In addition, make an array, arraylist will do.

A loop, put the original array of things into it one by one, and judge it before, if there is one, don't put it.

Finally sort the arraylist (there is a specialized. sort() method) to get what you want.

Dear is very happy for your question, given an array full of numbers, how to remove duplicate numbers, to remove duplicate numbers in the array, you can use different square scrolling methods. Here are some possible solutions:1

Use set: Converts an array to a set, and since duplicate elements are not allowed in the set, all duplicate numbers are automatically removed. Then, convert the collection back into an array.

arr = 1, 2, 3, 3, 4, 4, 5] unique arr = list(set(arr)) print(unique arr) output: [1, 2, 3, 4, 5]2Use a dictionary

Iterate over each number in the array and use them as the key of the Zen Chain Dictionary, while setting its value to true. Since the keys of the dictionary are unique, the duplicate digits will be automatically removed. Then, extract the keys from the dictionary to form a new array.

arr = 1, 2, 3, 3, 4, 4, 5] unique arr = list( Output: [1, 2, 3, 4, 5] 3Use list comprehension

Traverse the array using list parsing, selecting only the numbers that appear for the first time to add to the new array. arr = 1, 2, 3, 3, 4, 4, 5] unique arr = x for i, x in enumerate(arr) if x not in arr[:i]] print(unique arr) output:

1, 2, 3, 4, 5] All of these methods can be used to remove duplicate numbers from an array, depending on your needs and preferences for a particular problem.

Summary. Hello! Kiss To get rid of duplicate numbers in an array, you can use the following methods:

1.Use the set data structure: convert the array to set, because the nature of set does not allow duplicate elements, so that the duplicate numbers can be automatically removed.

Then convert the set back to an array. 2.Use hashmap:

Iterate through the array, use each number as the key of the hashmap, and the value can be set to any non-empty object. When a duplicate number is encountered, the key-value pair is overwritten, and only the value of one key is retained. Then convert the hashmap key to an array.

3.Sort the array first, then compare the adjacent elements in turn, skipping if they are equal, otherwise the unique elements will be stored in the new array. All of the above methods are effective in removing duplicate numbers from the array.

Which method to choose depends on your needs and the ease of implementation.

Hello! Kiss To remove the duplicate numbers in the array, you can use the following methods:1

Use the set data structure: convert the array to set, because the nature of set does not allow duplicate elements, so that the duplicate numbers can be automatically removed. Then convert the set back to an array.

2.Use hashmap: Iterate through the Huliang group, use each number as the key of the hashmap, and the value can be set to any non-empty object.

When a duplicate number is encountered, the key-value pair is overwritten, and only the value of one key is retained. Then convert the hashmap key to an array. 3.

Perform a row order on the array first, then compare the adjacent elements in turn, skipping if they are equal, otherwise the non-duplicate elements will be stored in the new array. All of the above methods are effective in removing duplicate numbers from the array. Which method to choose depends on your needs and the ease of implementation.

Kiss - If the original array needs to be kept in order, it is recommended to use hashset instead of set, as hashset keeps the insertion order. - If you want to count the number of rolls of duplicate numbers, you can use a hashmap and update the value of the corresponding key as you iterate through the array. - If the numbers in the array are not just integers, but also floating-point numbers or other types, you can use hashset or hashmap generics to handle this.

If the elements in the array are object types, you need to override the equals() and hashcode() methods of the Huaimu object to achieve the deduplication function.

Dear, I am the social livelihood of the people, Sister Xixi, I am honored to answer for you: The array in the C language is a set of continuous memory units, if you need to remove the specified element from the array, you need to move the element behind to fill the position of the deleted element Yuheng chain. If there are duplicate elements in the array, removing one element will cause the following elements to move forward in turn, but the duplicate elements will not be merged automatically, so the duplicate elements will appear at the end of the array.

For example, for the array a=, if you need to remove an element from the array, such as 4, you can use the following **: cint i, j, k; for (i = 0, j = 0; i < n; i++)n = j;n represents the length of the new array After executing the above **, the content of array a becomes, and you can see that the duplicate element 4 in the original array is not merged after deletion, but appears twice. If you need to merge duplicate elements, you need to iterate through the array while deleting the elements, merging adjacent and duplicate elements.

You can use a double loop to compare elements one by one, and if there are duplicates, delete the method to deduplicate.

The idea is: 1. Iterate through each element in the loop in turn.

2. For any element, compare it with the previous element in turn, and delete it if there is a duplicate.

3. The deletion operation can be used to move the subsequent elements forward one by one to achieve the effect of overwriting the current element.

On top of that, you can make a little optimization, that is, instead of moving all elements forward every time you delete an element, you can put the elements that need to be retained"Yes"It can be placed in a position that can improve efficiency.

int remove repeat(int *a, int l) deduplicates an array with a start address and length l, and the new length is returned as a return value. return r;Returns a new length. }

1. Write a method to traverse the array and deduplicate it in situ.

Diagram, declares an array index, and traverses the array backwards, when the traversed element and the index point to the element are not equal, the index moves backward and moves the current element to the index; Leave the index in place when the traversed element and the index point to the element equally.

2 A method that declares an output array with a specified number of elements.

As illustrated, the method accepts two parameters, an array and a specified number of elements, and outputs the relevant elements to console 3 to write a test method.

In the figure, the main method specifies the use case, tests the deduplication, and outputs the deduplicated array element 4 to run the test method.

Illustrated, execute the main method, observe the console output, as expected—from the network.

Idea: One of the first methods that comes to mind is to iterate, iterate through the entire array, put it into a new array if it hasn't been seen before, and return the array at the end.

function unique(array)}return n;

Check whether the browser supports indexof, which is a new method of ECMAscript5 and below IE8 (including IE8, IE8 only supports some ECMA5).

if(!for(var i = 0,len = ; i < len; i++)

return result;}}