visit.cpp

来自「数据结构中所有算法的实现」· C++ 代码 · 共 17 行

#include "d:\cpp\head.h"
void visit(char c){
  printf("%5c",c);
}
void xianshi(char *ch,void (*visit)(char c)){
  while(*ch!='\0'){
    visit(*ch);
    ch++;
  }
  printf("\n\n");
}
void main(){
  char ch[]="ABCDEFGHIJKLMNO";
  char *p;
  p=ch;
  xianshi(ch,visit);
}