h2内存数据库

摘要： static int findNum( const char* str){ char Num[8]; int i = 0; int reval = -1; const char* p = str; while ( *p && ((*p > '9') || (*p < '0'))) p++; if ( *p ) { while (*p <= '9' && *p >= '0' ) { Num[i++]= *p++; } } else { return reval; } if ( 阅读全文