数组分割,把数组分割成和相等的两部分--递归方法

// 数组分割问题2.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include 

using namespace std;


int getSum(int A[], int len)
{
	int sum = 0;
	for (int i = 0; i mList;
	return foo(Arr, len, 0, sum, B, 0);
}

int _tmain(int argc, _TCHAR* argv[])
{
	
	int Array[] = {1,3,5,7,6,8,4};

	int sum = getSum(Array, sizeof(Array)/sizeof(Array[0]));

	int B[10] = {0};
	bool bSet = isSubsetSum(Array, 7, sum/2, B);

	return 0;
}

你可能感兴趣的:(C++/C,算法)