-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMinDiffIdx.c
66 lines (57 loc) · 1.18 KB
/
MinDiffIdx.c
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
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include <stdio.h>
int main()
{
int a[] = { 1, 3, 5, 4, 8, 2, 4, 3, 6, 5 };
int x = 2, y = 3;
int n = sizeof(a) / sizeof(int);
int minDiffIdx = n;
int curX;
int haveX = 0;
int curY;
int haveY = 0;
int diff;
for (int i =0; i < n; i++)
{
if (a[i] == x)
{
if (haveY)
{
diff = i - curY;
if (diff < minDiffIdx)
{
minDiffIdx = diff;
}
}
if (!haveX)
{
haveX = 1;
}
curX = i;
}
else if (a[i] == y)
{
if (haveX)
{
diff = i - curX;
if (diff < minDiffIdx)
{
minDiffIdx = diff;
}
}
if (!haveY)
{
haveY = 1;
}
curY = i;
}
}
if (minDiffIdx == n)
{
printf("Pair not found!\n");
}
else
{
printf("Min Diff in Idx is %d\n",minDiffIdx);
}
return 0;
}