How does C language find more than half of the data in the array?
This article mainly explains "how to find more than half of the data in the array in C language". Interested friends may wish to take a look. The method introduced in this paper is simple, fast and practical. Let's let the editor take you to learn how C language can find more than half of the data in the array.
Find more than half of the number in the array. This question assumes that there must be a Majority Element. Otherwise, we have to judge what to do if it doesn't exist.
Int majorityElement (int* nums, int numsSize) {/ / it is obvious that the first complexity is not good / / int size=0; / / if (numsSize%2==0) {/ / size=numsSize/2; / /} else {/ / size= (numsSize-1) / 2; / /} / / int iMae j; / / int count=0; / / int flag=0; / / for