將兩個整型陣列按照升序排列,並且過濾掉重複陣列元素
解題思路:
1. 先將兩個陣列進行合併,可以利用C語言的memcpy函式進行;
2. 將新陣列進行氣泡排序;
3. 過濾掉重複元素;
程式碼如下:
#include <stdlib.h> #include<string.h>
//氣泡排序
void sortArray(int * inArr, int arrCount)
{
int i = 0;
for (int k = 0; k < arrCount - 1; k++)
{
for (int p = 0; p < arrCount - k - 1; p++)
{
if (inArr[p] > inArr[p + 1])
{
int temp = inArr[p];
inArr[p] = inArr[p + 1];
inArr[p + 1] = temp;
}
}
}
}
/* function:merge two arrays into one new array and sort its element by asc, then filter the dunplicate elements.
input:int * pArray1 :整型陣列1 int iArray1Num:陣列1元素個數 int * pArray2 :整型陣列2 int iArray2Num:陣列2元素個數
輸出:int * pOutputArray:合併後的陣列 int * iOutputNum:合併後陣列元素個數
返回:void */
void CombineBySort(int * pArray1, int iArray1Num, int * pArray2, int iArray2Num, int * pOutputArray, int * iOutputNum)
{
if (pArray1 == NULL || pArray2 == NULL || pOutputArray == NULL || iOutputNum == NULL) return;
if (iArray1Num == 0 && iArray2Num == 0) return;
int * pTempArray = (int *)malloc(sizeof(int) * (iArray1Num + iArray2Num));
if (pTempArray == NULL) return;
memcpy(pTempArray, pArray1, iArray1Num * sizeof(int));
memcpy(pTempArray + iArray1Num, pArray2, iArray2Num * sizeof(int));
sortArray(pTempArray, (iArray1Num + iArray2Num));
//進行了陣列剔除,並且賦值給輸出陣列中
int idx = 0;
pOutputArray[0] = pTempArray[0];
for (int q = 1; q < iArray1Num + iArray2Num; q++)
{
if (pOutputArray[idx] == pTempArray[q]) continue;
idx++;
pOutputArray[idx] = pTempArray[q];
}
*iOutputNum = idx + 1;
free(pTempArray);
return;
}