英文题求解（2）

[bobbylee123]

3. Write a function named getSubarray that will return a subarray of its array argument. The values of the subarray are the values of the original array that are between two given numbers m and n, inclusive, where m <= n. The elements in the subarray should be in the same order as they were in the original array. If m > n, return null. Note that m and n are values in the array , they are not indices of elements of the array!

If you are writing in C or C++ the signature is
int * getSubarray(int a[ ], int len, int m, int n) where len is the number of elements in the array.
Your function should not modify the input array in any way! You will have to dynamically allocate a correctly sized array to hold the subarray.
Hint: To allocate an array in Java or C# use
int[ ] result = new int[count]
To allocate the array in C or C++ use
int * result = (int *)calloc(sizeof(int), count+1) where the last element is n+1 to mark the end of the array.
Examples

[bobbylee123]

请哪位大哥给出解题答案

[GKatHere]

#include "stdafx.h"
#include "math.h"
#include <conio.h>//
#include <istream.h>
#include <stdlib.h>

int * getSubarray(int a[ ], int len, int m, int n);
int iOrignal[] = {3, 9, -3, 1, 0, 3, 10};
int main(int argc, char* argv[])
{
	int * pi;
	int m = 0;
	int n = 3;
	pi = getSubarray(iOrignal, sizeof(iOrignal)/sizeof(int), m, n);
	if(pi == NULL)
		printf("取值时低值大于高值");
	else
	{	
		printf("新数组为:\n");
		for(int iE = 0; pi[iE] != 3+1; iE++)
			printf("%d,",pi[iE]);
	}
	
	free(pi);
	getch();
}


/*
getSubarray函数从数组a中抽取值为m,n(m <= n)之间的数(含m,n)，组成并返回新数组指针.
当m > n时，返回NULL
新数组以元素值为(n + 1)表数组结束.
*/

int * getSubarray(int a[ ], int len, int m, int n)
{
	if (m > n)
		return NULL;
	int * result = (int *)calloc(sizeof(int), len+1);
	int iCount = 0;
	for (int i = 0; i < len; i++)
	{
		if(a[i] >= m && a[i] <= n)
		{
			result[iCount] = a[i];
			iCount++;
		}
	}
	printf("获得元素个数:%d\n",iCount);
	int * piReturn = (int *)realloc(result, sizeof(int) * (iCount + 1 + 1));
	piReturn[iCount] = n+1;
	return piReturn;
}