Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //Exercise 3
- int mostOccurring(int *arr, int n, int *countPtr);
- int isAmountAsK(int *arr, int n, int k) {
- int *count = (int*)calloc((k + 1), sizeof(int)), i;
- for (i = 0; i < n; i++)
- count[arr[i]]++;
- for (i = 0; i <= k; i++) {
- if (count[i] != i) {
- free(count);
- return 0;
- }
- }
- free(count);
- return 1;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement