zhan_qian的博客

#include<stdio.h>int Max(int n1,int n2){ if(n1>n2){ return n1; } return n2;}int main(){ int n=6,c=12;/*6个物品，背包容量为12*/ int value[]={0,6,3,5,4,3,6};/*物品价值，从下标1开始*/ int weight[]={0,4,6,2,2,5,3};/*物品重量，从下表1开始*/ .

#include<stdio.h>int Max(int n1,int n2){ if(n1>n2){ return n1; } return n2;}int main(){ int n=6,c=12;/*6个物品，背包容量为12*/ int value[]={0,6,3,5,4,3,6};/*物品价值，从下标1开始*/ int weight[]={0,4,6,2,2,5,3};/*物品重量，从下表1开始*/ .

#include<stdio.h>#include<stdlib.h>struct stack{ int *data; int top; int maxSize;};struct stack *createStack(int maxsize){ struct stack *s; s=malloc(sizeof(struct stack)); s->data=malloc(sizeof(int)*maxsize); .

#include<stdio.h>int length(char *str){ int i=0; while(str[i]!='\0'){ i++; } return i;}int BF(char *txt,char *str){/*返回第一个匹配子串的位置下标*/ int m=length(txt); int n=length(str); for(int i=0;i<=m-n;i++){ in.

#include<stdio.h>int biger(int n1,int n2){ if(n1>n2){ return n1; } return n2;}int get_height(int arr[],int n){ if(n==1){ return 1; } int b[n]; for(int i=0;i<n;i++){ b[i]=1; } int r.

#include<stdio.h>int n,count;/*全局变量默认为0*/int collision(int a[],int row,int column){/*检查是否冲突*/ for(int i=1;i<=row;i++){ if(a[i]==column){ return 0; }else if(i+a[i]==row+column){ return 0; }else.

#include<stdio.h>int length(char *str){ int i=0; while(str[i]!='\0'){ i++; } return i;}void getNextval(char *str,int nextval[]){ int i=0,j=-1; nextval[0]=-1; while(i<length(str)){ if(j==-1||str[i]==s.

#include<stdio.h>int length(char *str){ int i=0; while(str[i]!='\0'){ i++; } return i;}void getNext(char *str,int next[]){ int i=0,j=-1; next[0]=-1; while(i<length(str)-1){ if(j==-1||str[i]==str[j]){.