Merge pull request #8 from Hxhao2000/master

修复C++版本中排序与数组越界的漏洞

Author: wangwei2009

c++/SRP/Sort.cpp

@@ -5,10 +5,11 @@ sort_result findMaxIndex(int *data, int len)
 	sort_result result;
 
 	result.Maxindex = 0;
+	result.MaxVal = data[0];
 
 	for (int i = 0; i < len-1; i++)
 	{
-		if (data[i] < data[i + 1])
+		if (result.MaxVal < data[i + 1])
 		{
 			result.MaxVal = data[i + 1];
 			result.Maxindex = i + 1;

c++/SRP/main.cpp

@@ -77,7 +77,7 @@ int main(int argc, char *argv[])
 
 	for (uint16_t i = 0; i < 360; i=i+1)
 	{
-		memset(yout, 0, DataLen * sizeof(yout));
+		memset(yout, 0, DataLen * sizeof(float));
 		DelaySumURA(data, yout, fs, DataLen, N_FFT, WinLen, 256, r, i);
 		//Write_File(yout, DataLen, "yout1.txt");
 		for (uint32_t j = 0; j < DataLen; j++)
@@ -110,7 +110,7 @@ int main(int argc, char *argv[])
 
 
 
-    //_CrtDumpMemoryLeaks();//调试运行到该步，输出检测信息
+    //_CrtDumpMemoryLeaks();//�������е��ò�����������Ϣ
 
 
 	return 0;

c++/SRP/main_linux.cpp

@@ -77,7 +77,7 @@ int main(int argc, char *argv[])
 
 	for (uint16_t i = 0; i < 360; i=i+1)
 	{
-		memset(yout, 0, DataLen * sizeof(yout));
+		memset(yout, 0, DataLen * sizeof(float));
 		DelaySumURA(data, yout, fs, DataLen, N_FFT, WinLen, 256, r, i);
 		//Write_File(yout, DataLen, "yout1.txt");
 		for (uint32_t j = 0; j < DataLen; j++)

c++/SRP/main_win32.cpp

@@ -76,7 +76,7 @@ int main(int argc, char *argv[])
 
 	for (uint16_t i = 0; i < 360; i=i+1)
 	{
-		memset(yout, 0, DataLen * sizeof(yout));
+		memset(yout, 0, DataLen * sizeof(float));
 		DelaySumURA(data, yout, fs, DataLen, N_FFT, WinLen, 256, r, i);
 		//Write_File(yout, DataLen, "yout1.txt");
 		for (uint32_t j = 0; j < DataLen; j++)