Pop_SqStack(&S,&k); /*回溯寻求下一个解*/ k怎么变化?#include#include #define MAXSIZE 100 /*最多元素数*/ typedef int ElemType; typedef struct{ ElemType data[MAXSIZE]; /*栈空间*/ int top; /*栈顶指针*/ }SqStack; void Init_SqStack(
来源:学生作业帮助网 编辑:作业帮 时间:2024/06/24 22:02:52
![Pop_SqStack(&S,&k); /*回溯寻求下一个解*/ k怎么变化?#include#include #define MAXSIZE 100 /*最多元素数*/ typedef int ElemType; typedef struct{ ElemType data[MAXSIZE]; /*栈空间*/ int top; /*栈顶指针*/ }SqStack; void Init_SqStack(](/uploads/image/z/13451583-39-3.jpg?t=Pop_SqStack%28%26S%2C%26k%29%3B+%2F%2A%E5%9B%9E%E6%BA%AF%E5%AF%BB%E6%B1%82%E4%B8%8B%E4%B8%80%E4%B8%AA%E8%A7%A3%2A%2F+k%E6%80%8E%E4%B9%88%E5%8F%98%E5%8C%96%3F%23include%23include+%23define+MAXSIZE+100+%2F%2A%E6%9C%80%E5%A4%9A%E5%85%83%E7%B4%A0%E6%95%B0%2A%2F+typedef+int+ElemType%3B+typedef+struct%7B+ElemType+data%5BMAXSIZE%5D%3B+%2F%2A%E6%A0%88%E7%A9%BA%E9%97%B4%2A%2F+int+top%3B+%2F%2A%E6%A0%88%E9%A1%B6%E6%8C%87%E9%92%88%2A%2F+%7DSqStack%3B+void+Init_SqStack%28)
Pop_SqStack(&S,&k); /*回溯寻求下一个解*/ k怎么变化?#include#include #define MAXSIZE 100 /*最多元素数*/ typedef int ElemType; typedef struct{ ElemType data[MAXSIZE]; /*栈空间*/ int top; /*栈顶指针*/ }SqStack; void Init_SqStack(
Pop_SqStack(&S,&k); /*回溯寻求下一个解*/ k怎么变化?
#include
#include
#define MAXSIZE 100 /*最多元素数*/
typedef int ElemType;
typedef struct{
ElemType data[MAXSIZE]; /*栈空间*/
int top; /*栈顶指针*/
}SqStack;
void Init_SqStack(SqStack *S){S->top=-1;} //栈空
int Empty_SqStack(SqStack *S){
if(S->top==-1)
return 1;
else
return 0;
}
void Push_SqStack(SqStack *S,ElemType x){
if(S->top==MAXSIZE-1){ /*栈满,不能入栈*/
printf(" 栈满!"); exit(0);
}
else /*栈非满,x入栈*/
S->data[++S->top]=x;
}
void Pop_SqStack(SqStack *S,ElemType *x){
if(Empty_SqStack(S)){/*栈空,不能进行出栈*/
printf(" 栈空!");
exit(0);
}
else{ /*把栈顶元素存入变量x*/
*x=S->data[ S->top];
S->top--;
\x05\x05\x05 }
}
void knap(int w[],int t,int n){
SqStack S;
int j,k;
Init_SqStack(&S);
k=0; /*从 0号物品开始扫描*/
do{
while(k=0){ /*序号为 k的物品入栈*/
Push_SqStack(&S,k);
t-=w[k];
}
k++;
}
if(t==0){ /*输出一个解*/
printf("\nresult:\n");
for(j=0;j
Pop_SqStack(&S,&k); /*回溯寻求下一个解*/ k怎么变化?#include#include #define MAXSIZE 100 /*最多元素数*/ typedef int ElemType; typedef struct{ ElemType data[MAXSIZE]; /*栈空间*/ int top; /*栈顶指针*/ }SqStack; void Init_SqStack(
k=S->data[ S->top];