aboutsummaryrefslogtreecommitdiff
path: root/find_duplicate_num.c
blob: 55494033446ae36e3a8c8ade694716182a4fb833 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
// 287. Find the Duplicate Number
#include "leetcode.h"

/* given an integer array 'nums' containing 'n + 1' integers where each integer
 * is in the range '[1, n]' inclusive. there is only one repeated number in
 * 'nums', return this repeated number. you must solve the problem without
 * modifying the array 'nums' and uses only constant extra space.
 */

int findDuplicate(int *nums, int nums_size) {
  int *cnt = (int *)calloc(nums_size, sizeof(int));
  for (int i = 0; i < nums_size; i++)
    cnt[nums[i] - 1]++;
  for (int i = 0; i < nums_size; i++)
    if (cnt[i] >= 2)
      return i + 1;
  free(cnt);
  return -1;
}

int main() {
  int n1[] = {1, 3, 4, 2, 2}, n2[] = {3, 1, 3, 4, 2};
  printf("%d\n", findDuplicate(n1, 5)); // expect: 2
  printf("%d\n", findDuplicate(n2, 5)); // expect: 3
}