统计一个字符串中最长数字子串的个数并输出
#include <stdio.h> #include <string.h> #define MAX_SIZE 1024 void state_str(char *str, char *digit_str) { int count = 0; int max_len = 0; char *max_start = NULL; while (*str != '\0') { while (((*str >= '0') && (*str <= '9')) && *str != '\0') { count++; str++; } if (count > max_len) { max_len = count; max_start = str - count; } count = 0; str++; if (max_len > 0 && max_start != NULL) { strncpy(digit_str, max_start, max_len); digit_str[max_len] = '\0'; } else { digit_str[0] = '\0'; } } printf("%d\n", max_len); printf("%s\n", digit_str); } int main() { char str[MAX_SIZE] = {0}; char digit_str[MAX_SIZE] = {0}; printf("请输入一串字符串: \n"); scanf("%s", str); printf("最长连续子串的个数以及该子串为: \n"); state_str(str, digit_str); return 0; }
)
