编程超级大难题

显示全部楼层 · 2010-10-31 10:12:09

如果给出字符串“abcdefghijklmnopqrstyvwxyz”，编程穷举出由这些字符组成的所有(数量太多可以只要穷举出长度3以内的）字符串，例如：abc，bca，cba x ....

千问 · 2010-10-31 10:12:09

// 非递归调用版#include #include charalpha[] = "abcdefghijklmnopqrstuvwxyz";int alpha_count = 26;#define
ALPHA_FIRST
(alpha[0])#define
ALPHA_LAST
(alpha[alpha_count-1])#define
ALPHA_NEXT(c) (*(strchr(alpha, (c))+1))void enum_alpha(int len){
char
buff[len+1];