0X78: //16字符串最长无重复子串 #include #include #pragma warning(disable:4996); //#define n 100 int main() { char zfc[100] = { NULL }; printf("请输入字符串："); scanf("%s", zfc); int n = strlen(zfc); for (int i = 0; i < n ; i++) { int zfc_i = 0; for (int ii = 0; ii < n ; ii++) { if (ii == i) ii++; if (ii >= n) break; if (zfc[i] == zfc[ii]) { zfc[ii] = NULL; zfc_i = 1; } } if (zfc_i == 1) zfc[i] = NULL; } for (int i = 0; i < n; i++) { if (zfc[i] != NULL) { printf("%c %d\n", zfc[i], i); } } //fc[0] = '\0'; return 0; }

0X78: //15字符串旋转 #include #include #pragma warning(disable:4996); #define n 100 int main() { char A[n], B[n]; printf("请输入字符串A："); scanf("%s", A); printf("请输入字符串B："); scanf("%s", B); int B_C_i[n] = { NULL }; //记录在A中首字母B位置，多个 int AB_F = 0;//记录A可分段的次数，及A中有多少个B首字母 for (int i = 0; i < n && A[i] != NULL; i++) { if (B[0] == A[i]) { B_C_i[AB_F] = i; AB_F++; } } char xing[n]; for (int i = 0; i < AB_F; i++) { int iii = 0; for (int ii = B_C_i[i]; ii < n && A[ii] != NULL; ii++) { if (A[ii] == B[ii - B_C_i[i]]) { xing[iii] = A[ii]; //printf("%c\n", xing[iii]); iii++; } } for (int ii = 0; ii < B_C_i[i]; ii++) { if (A[ii] == B[ii + B_C_i[i]]) { xing[iii] = A[ii]; //printf("%c\n", xing[iii]); iii++; } } iii = 0; if (!strstr(B, xing)) { printf("trun"); } else printf("false"); } return 0; }

0X78: //14数组中出现次数超过一半的数字 #include #include #pragma warning(disable:4996); int main(){ int n; scanf("%d", &n); int* sz; sz = (int*)malloc(n * (sizeof(int))); for (int i = 0; i < n; i++) { scanf("%d", &sz[i]); } int* bc; bc = (int*)malloc(n * (sizeof(int))); int cf = 1; for (int i = 0; i < n; i++) { cf = 1; for (int ii=0; ii < n; ii++) { if (i == ii) ii++; if (ii >= n || sz[ii] == NULL)break; if (sz[i] == sz[ii]) { cf++; sz[ii] = NULL; } } if (cf > n / 2)printf("%d\n", sz[i]); cf = 1; } free(sz); return 0; }

0X78: //13数组中出现一次的两个数字 #include #include #pragma warning(disable:4996); int main() { int n; scanf("%d", &n); int* sz; int* cx; cx = (int*)malloc(n * (sizeof(int))); sz = (int*)malloc(n * (sizeof(int))); for (int i = 0; i < n; i++) { scanf("%d", &sz[i]); cx[i] = 1; } int cx_i = 0; for (int i = 0; i < n; i++) { for (int ii = 0; ii < n; ii++) { if (ii == i)break; if (sz[i] == sz[ii]) { cx[i]++; cx[ii]++; } } } for (int i = 0; i < n; i++) { if (cx[i] == 1)printf("\n%d \n", sz[i]); } free(sz); free(cx); return 0; }

0X78: //12岛屿数量 #include #pragma warning(disable:4996); int main() { int juz[100][100]; int a, b; scanf("%d %d", &a, &b); for (int i = 0; i < b; i++) { for (int ii = 0; ii < a; ii++) { scanf("%d", &juz[i][ii]); } } //a为juz[b][a]; int land = 0; for (int i = 0; i < b; i++) { for (int ii = 0; ii < a; ii++) { int right = 1; int down = 1; if (i == b - 1) right = 0; if (ii == a - 1) down = 0; if (juz[i][ii] == 1) { land++; juz[i][ii] = 2; if (juz[i + right][ii] == 1) juz[i + right][ii] = 2; if (juz[i][ii + down] == 1) juz[i][ii + down] = 2; } if (juz[i][ii] == 2) { if (juz[i + right][ii] == 1) juz[i + right][ii] = 2; if (juz[i][ii + down] == 1) juz[i][ii + down] = 2; } } } printf("共有岛屿：%d\n", land); for (int i = 0; i < b; i++) { for (int ii = 0; ii < a && juz[i][ii]!=0; ii++) { printf("%d ", juz[i][ii]); } printf("\n"); } return 0; }