算法笔记.pdfVIP

文件: C:\Users\shantao\Desktop\算法笔记.txt 2015/2/26, 16:27:33 如 何判断一个数是奇数还是偶数：int a;a1==1奇数；a1==0；偶数 #include stdio.h #include stdlib.h void quanpai(int *array,int qishi,int length) { if(qishi==length-1) { for(int i=0;ilength;i++) { printf(%d,array[i]); } printf(、); } else{ for(int i=qishi;ilength;i++) { int temp=array[qishi]; array[qishi]=array[i]; array[i]=temp; quanpai(array,qishi+1,length); temp=array[qishi]; array[qishi]=array[i]; array[i]=temp; } } } int main() { int a[]={1,2,3,4,5}; int length=sizeof(a)/sizeof(int); quanpai(a,0,length); printf(\n); return 0; } #include stdio.h #include stdlib.h bool isHave(int *array,int row,int lie,int item) { int i=0; int j=lie-1; while(irow j-1) { if(array[i][j]==item) { return true; } else if(itemarray[i][j]) { j--; } else { i++; } 页: 1 文件: C:\Users\shantao\Desktop\算法笔记.txt 2015/2/26, 16:27:33 } return false; } int main() { int a[3][3]={{1,2,3},{4,5,6},{7,8,9}}; int length=sizeof(a)/sizeof(int); printf(%b,isHave(a,3,3,8)); return 0; } #include stdio.h #include stdlib.h void tiHuan(char *string,int length) { if(string==NULL length=0) { printf(输入的字符串不合法！); }else { int i=0; int count=0; int orglength=0; while(string[i]!=\0) { orglength++; if(string[i]== ) { count++; } i++; } if(count==0) { printf(字符串不需要替换！); } else { int newlength=orglength+2*count; while(orglength-1 newlength-1) { if(string[orglength]== ) { string[newlength--]=0; string[newlength--]=2; string[newlength--]=%; } else { string[newlength--]=string[orglength]; } orglength