计算数组中第三大元素

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
#include<stdio.h>
int Third(int *nums,int numsSize)
{
int i = 0;
int min = nums[0];
while(i < numsSize)//find the smallest number.
{
if(min > nums[i])
{
min = nums[i];
}
i++;
}
i = 0;
int a = min, b = min, c = min;
while(i < numsSize)//find the maximum number.
{
if(nums[i] >= a)
{
a = nums[i];
}
i++;
}
i = 0;
while(i < numsSize)//Find the second largest number
{
if(nums[i] >= b && nums[i] < a)
{
b = nums[i];
}
i++;
}
i = 0;
while(i < numsSize)//Find the thired largedt number
{
if(nums[i] >= c && nums[i] < b)
{
c = nums[i];
}
i++;
}
if(a != b && a != c && b != c)
{
return c;
}
else
{
return a;
}
}
int main()
{
int arr[] = {2,2,3,1,4,4,5};
int ret = Third(arr,sizeof(arr)/sizeof(arr[0]));
printf("%dn",ret);
return 0;
}