softdzf的专栏

<br />给定两个字符串s1和s2，要求判断s2是否能够通被通过s1做循环移位（rotate）得到的字符串包含。例如，给定s1=AABCD 和 s2=CDAA，返回true；给定s1=ABCD和s2=ACBD，返回false.<br /> <br />#include <stdio.h> #include <string.h> //解法一 bool CheckContain(char *source, char *dest) { int len1 = 0, len2 = 0; len1 =

<br />给定电话号码，输出其对应键盘代表的所有字母组合。如：给定号码5869872，输出jtmwtpa、jtmwtpb.....<br />#include <stdio.h> #include <string.h> //键盘映射 char keyboard[10][5] = { "", //0 "", //1 "abc", //2 "def", //3 "ghi", //4 "jkl", //5 "mno", //6 "pqrs", //7 "tuv",