编程之美.docVIP

第3章 结构之法——字符串及链表的探索 代码清单3-1 char src[5] = ”AABCD”; char des[5] = ”CDAA”; int len = strlen(src); for(int i = 0; i len; i++) { char tempchar = src[0]; for(int j = 0; j len - 1; j++) src[j] = src[j + 1]; src[len - 1] = tempchar; if(strstr(src, des) == 0) { return (true); } } return false; 代码清单3-2 char c[10][10] = { , //0 , //1 ABC, //2 DEF, //3 GHI, //4 JKL, //5 MNO, //6 PQRS, //7 TUV, //8 WXYZ, //9 }; 代码清单3-3 for(answer[0] = 0; answer[0] total[number[0]]; answer[0]++) for(answer[1] = 0; answer[1] total[number[1]]; answer[1]++) for(answer[