Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int mostCommon(int *input, int inLength, int upperLimit, int *outIndex, int *outCount) {
- upperLimit++; //behöver ha index till och MED upperLimit
- int occurences[upperLimit];
- int indexes[upperLimit];
- memset(occurences, 0, upperLimit * sizeof(int)); //alla index = 0
- memset(indexes, -1, upperLimit * sizeof(int)); //alla index = -1
- for(int i = 0; i < inLength; i++) {
- int number = input[i];
- occurences[number]++;
- if(indexes[number] < 0) {
- indexes[number] = i;
- }
- }
- int number = -1;
- int count = -1;
- int index = -1;
- for(int i = 0; i < upperLimit; i++) {
- if(occurences[i] > count) {
- count = occurences[i];
- index = indexes[i];
- number = i;
- }
- }
- (*outIndex) = index;
- (*outCount) = count;
- return number;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement