添加以线性方法来求解最大子数组的代码

Author: qeesung

chapter4/4-1/bestMethodMaxSubArray/maxSubArray.c

@@ -0,0 +1,38 @@
+#include <stdio.h>
+#include <limits.h>
+#include <stdlib.h>
+
+int getMaxSubArray(const int inputArray[] , const int arrayLength , int * leftBorder , int * rightBorder)
+{
+	int left ; int right;
+	int sum=0;
+	int max=INT_MIN;
+	int i=0;
+	left = 0;
+	for(i=0;i<arrayLength ; ++i)
+	{
+		sum+=inputArray[i];
+		if(sum < 0)
+		{
+			sum = 0;
+			left = i+1;
+		}
+		if(sum > max)
+		{
+			max = sum;
+			right = i;
+		}
+	}
+	*leftBorder = left;
+	*rightBorder = right;
+	return max;
+}
+
+int main(int argc, char const *argv[])
+{
+	const int array[]={13,-3,-25,20,-3,-16,-23,18,20,-7,12,-5,-22,15,-4,7};
+	int leftBorder,rightBorder;
+	int max = getMaxSubArray(array , sizeof(array)/sizeof(int) , &leftBorder , &rightBorder);
+	printf("from %d to %d is the max sub array and the max value is : %d \n",leftBorder , rightBorder , max );
+	return 0;
+}