寻找和为定值的多个数

输入两个整数 n 和 m，从数列1，2，3.......n 中 随意取几个数,
使其和等于 m ,要求将其中所有的可能组合列出来。

解析：可以看出这是关于0-1背包问题，可以将问题定义为f(n,m),从1->n中选择多个数，使得之和为m

           那么（1）选取n，则剩下从n-1个数中选择和为m-n的数，即求f(n-1,m-n)

                   ( 2）不选取n，则从剩下的n-1个数中选择和为m的数，即求f(n-1, m)

#include<stdio.h>
#include<stdlib.h>
//定义栈
typedef int data_t;
typedef struct stack {
    data_t *data;
    int max;
    int top;
} sstack_t;

//创建
sstack_t *creat_stack(int max)
{
    sstack_t *stack = malloc(sizeof(sstack_t));
    if(NULL == stack)
        return NULL;
    stack->data = malloc(max * sizeof(data_t));
    if(NULL == stack->data) {
        free(stack);
        return NULL;
    }
    stack->top = -1;
    stack->max = max;
    printf("create success!\n");
    return stack;
}
//打印
void print_stack(sstack_t *stack)
{
    int i;
    for(i = stack->top; i >= 0; i --) {
        printf("%d + ", stack->data[i]);
    }
}

//入栈
int push_stack(sstack_t *stack, const data_t *data)
{
    if(NULL == data || NULL == stack)
        return -1;
    if(stack->top + 1 >= stack->max)
        return -2;
    stack->data[++stack->top] = *data;
    return 0;
}

//出栈
int pop_stack(sstack_t *stack, data_t *databuf)
{
    if(NULL == stack || NULL == databuf)
        return -1;
    if(stack->top == -1)
        return -2;
    *databuf = stack->data[stack->top--];
    return 0;
}

//获取头部
int get_top_stack(sstack_t *stack, data_t *databuf)
{
    *databuf  = stack->data[stack->top];
    return 0;
}

//是否为空
int empty_stack(sstack_t *stack)
{
    if(NULL == stack)
        return -1;
    return stack->top == -1;
}

//是否满
int full_stack(sstack_t *stack)
{
    if(NULL == stack)
        return -1;
    return stack->top == stack->max - 1;
}

//清空栈
int clean_stack(sstack_t *sp)
{
    sp->top = -1;
    return 0;
}

sstack_t *sp = NULL;

void findFactor(int sum, int n)
{
    data_t buf = n;
    if(n <= 0 || sum <= 0)
        return;

    if(sum == n) {
        print_stack(sp);
		printf("%d\n", n);
    }
	
    if(NULL != sp) {
        push_stack(sp, &buf);
        findFactor(sum - buf, buf - 1);
        pop_stack(sp, &buf);
        findFactor(sum, buf - 1);
    }
}

int main(void)
{
    int sum = 12, n = 12;
    data_t i = 0;
	sp = creat_stack(n);
    findFactor(sum, n);
    if(NULL != sp)
        free(sp);
    sp = NULL;
    return 0;
}

/*
打印
12
11 + 1
10 + 2
9 + 3
2 + 9 + 1
8 + 4
3 + 8 + 1
7 + 5
4 + 7 + 1
3 + 7 + 2
5 + 6 + 1
4 + 6 + 2
2 + 3 + 6 + 1
4 + 5 + 3
2 + 4 + 5 + 1

*/