问题:计算数组中不同元素的个数和
int SumArray(int *Array,int ArrayNum)
{
int len = ArrayNum;
for (int i = 0; i < ArrayNum; i++)
{
for (int j = i + 1; j < ArrayNum; j++)
{
if (Array[j] == Array[i])
{
// 重复,数组总长度减1
len--;
break;
}
}
}
return len;
}
算法描述:
(1)每次只按顺序找当前Array[i]后面,满足Array[j]==Array[i]的一个元素。找到后len–,并跳出当前循环;
(2)i++,执行(1)步骤,直到 i > ArrayNum 结束。
笔试题:
我写的代码(不一定对,可能逻辑有问题):
#include <iostream>
using namespace std;
int SumArray(float *Array, int ArrayNum)
{
int len = ArrayNum;
for (int i = 0; i < ArrayNum; i++)
{
for (int j = i + 1; j < ArrayNum; j++)
{
if (Array[j] == Array[i])
{
// 重复,数组总长度减1
len--;
break;
}
}
}
return len;
}
int main()
{
int numOfPickupLoc=3;
int baseCoorp[2] = {0,0};
int pickupLoc[10][2] = { {1,1},{-1,1},{2,3} };
float *pickupLocTan = (float *)malloc(numOfPickupLoc*sizeof(float));
for (int i = 0; i < numOfPickupLoc; i++)
{
pickupLocTan[i] = (float)(pickupLoc[i][1]- baseCoorp[1]) / (pickupLoc[i][0]- baseCoorp[0]);
}
cout << SumArray(pickupLocTan,numOfPickupLoc);
system("pause");
}