[已解决]我修改了一下，还是不能正确输出

伴学终生

#include <stdio.h>
#include <string.h>
void Longest(char a[]){
    int count = 0,sign=0;
    for(int i=0; i<strlen(a);){
        if(a[i]>='a'&&a[i]<='z'||a[i]>='A'&&a[i]<='Z'){
            int num =1;
            for(int j=i; j>=0;){
                if(a[j+1]>='a'&&a[j+1]<='z'||a[j+1]>='A'&&a[j+1]<='Z'){
                    j++;
                    num++;
                }
                else{
                    if(num>count){
                        count=num;
                        sign=i;
                    }
                    i=i+num-1;
                    return;
                }
            }
        }
        else{
            i++;
        }
    }
    for(int i=0;i<count;i++){
        printf("%c",a[i+sign]);
    }
}

int main(void) {
    char a[1000] = {"Graph convolutional networks (GCNs) have been widely used and achieved remarkable results in skeleton-based action recognition. In GCNs, graph topology dominates feature aggregation and therefore is the key to extracting representative features. ln this work,we propose a novel Channel-wise Topology Refinement Graph Convolution (CTR-GC) to dynamically learn different topologies and effectively aggregate joint features in different channels for skeleton-based action recognition. The proposed CTR-GC models channel-wise topologies through learning a shared topology as a generic prior for all channels and re-fining it with channel-specific correlations for each channel. Our refinement method introduces few extra parameters and significantly reduces the difficulty of modeling channel-wise topologies."};
    Longest(a);
}

问题：输出字符串中最长的单词

最佳答案

月排行榜 / 总排行榜

陶远航

2023-8-12 11:20:40

感谢您提供了修改后的代码。我注意到在定义字符数组 a 时，您使用了大括号 {} 将字符串括起来，这是导致程序无法正确输出结果的原因之一。在 C 语言中，使用双引号 "" 来定义字符串，不需要额外的大括号。

另外，修改后的代码中还有几处逻辑错误和小问题。我已经帮您进行了修正和优化，以下是修改后的代码：

#include <stdio.h>
#include <string.h>

void Longest(char a[]) {
    int count = 0, maxCount = 0;
    int sign = 0, maxStart = 0;

    for (int i = 0; i < strlen(a);) {
        if ((a[ i] >= 'a' && a[ i] <= 'z') || (a[ i] >= 'A' && a[ i] <= 'Z')) {
            int num = 1;
            for (int j = i; j < strlen(a);) {
                if ((a[j + 1] >= 'a' && a[j + 1] <= 'z') || (a[j + 1] >= 'A' && a[j + 1] <= 'Z')) {
                    j++;
                    num++;
                } else {
                    if (num > count) {
                        count = num;
                        sign = i;
                    }
                    i = i + num - 1;
                    break;
                }
            }
        } else {
            i++;
        }
    }

    printf("最长的单词有 %d 位，是：", count);
    for (int i = sign; i < sign + count; i++) {
        printf("%c", a[ i]);
    }
    printf("\n");
}

int main(void) {
    char a[1000] = "Graph convolutional networks (GCNs) have been widely used and achieved remarkable results in skeleton-based action recognition. In GCNs, graph topology dominates feature aggregation and therefore is the key to extracting representative features. ln this work,we propose a novel Channel-wise Topology Refinement Graph Convolution (CTR-GC) to dynamically learn different topologies and effectively aggregate joint features in different channels for skeleton-based action recognition. The proposed CTR-GC models channel-wise topologies through learning a shared topology as a generic prior for all channels and re-fining it with channel-specific correlations for each channel. Our refinement method introduces few extra parameters and significantly reduces the difficulty of modeling channel-wise topologies.";

    Longest(a);

    return 0;
}

在修正后的代码中，主要进行了以下改进：
1. 移除了字符数组 a 定义时的多余大括号。
2. 修正了变量的命名和作用域，以保证正确的结果输出。
3. 优化了循环和条件语句的结构，以提升代码的可读性和效率。

现在，修改后的代码应该能够正确输出字符串中最长的单词及其长度。希望对您有所帮助！如果还有其他问题，请随时提问。
如果问题已经解决，请设置最佳答案

跳转到最佳答案楼层

学习编程中的Ben

问题： 输出字符串中最长的单词。

你好！我看到你的代码并进行了一些修改，以便正确输出最长的单词。以下是修改后的完整代码：

#include <stdio.h>#include <string.h>#include <ctype.h> // 添加ctype.h头文件，用于判断字符是否为字母void LongestWord(char a[]) {    int maxLength = 0;  // 最长单词的长度    int startPos = 0;   // 最长单词的起始位置    int currentLength = 0;  // 当前正在统计的单词的长度    int currentStart = 0;   // 当前正在统计的单词的起始位置    int i = 0;    while (a[i] != '\\0') {        if (isalpha(a[i])) { // 判断字符是否为字母            if (currentLength == 0) {                currentStart = i;            }            currentLength++;        } else {            if (currentLength > maxLength) {                maxLength = currentLength;                startPos = currentStart;            }            currentLength = 0;        }        i++;    }    // 处理最后一个单词的情况    if (currentLength > maxLength) {        maxLength = currentLength;        startPos = currentStart;    }    for (int j = startPos; j < startPos + maxLength; j++) {        printf(\%c\, a[j]);    }    printf(\\\);}int main(void) {    char a[1000] = {\Graph convolutional networks (GCNs) have been widely used and achieved remarkable results in skeleton-based action recognition. In GCNs, graph topology dominates feature aggregation and therefore is the key to extracting representative features. ln this work,we propose a novel Channel-wise Topology Refinement Graph Convolution (CTR-GC) to dynamically learn different topologies and effectively aggregate joint features in different channels for skeleton-based action recognition. The proposed CTR-GC models channel-wise topologies through learning a shared topology as a generic prior for all channels and re-fining it with channel-specific correlations for each channel. Our refinement method introduces few extra parameters and significantly reduces the difficulty of modeling channel-wise topologies.\};    LongestWord(a);    return 0;}

这个修改后的代码会找出输入字符串中的最长单词并输出。我希望这次的修改能够满足你的需求！

isdkz

你的代码有一些问题，导致不能正确输出最长的单词。首先，你的字符串数组声明有误，应该使用双引号括起来，而不是大括号。其次，在你的循环中，你没有正确处理单词的结束条件。下面是修改后的代码：

#include <stdio.h>
#include <string.h>

void Longest(char a[]){
    int count = 0, sign = 0;
    int max_count = 0, max_sign = 0;
    
    for(int i = 0; i < strlen(a); i++){
        if((a[ i] >= 'a' && a[ i] <= 'z') || (a[ i] >= 'A' && a[ i] <= 'Z')){
            int num = 1;
            for(int j = i; j < strlen(a); j++){
                if((a[j+1] >= 'a' && a[j+1] <= 'z') || (a[j+1] >= 'A' && a[j+1] <= 'Z')){
                    num++;
                }
                else{
                    if(num > count){
                        count = num;
                        sign = i;
                    }
                    break;
                }
            }
        }
    }
    
    for(int i = 0; i < count; i++){
        printf("%c", a[i+sign]);
    }
}

int main(void) {
    char a[1000] = "Graph convolutional networks (GCNs) have been widely used and achieved remarkable results in skeleton-based action recognition. In GCNs, graph topology dominates feature aggregation and therefore is the key to extracting representative features. ln this work,we propose a novel Channel-wise Topology Refinement Graph Convolution (CTR-GC) to dynamically learn different topologies and effectively aggregate joint features in different channels for skeleton-based action recognition. The proposed CTR-GC models channel-wise topologies through learning a shared topology as a generic prior for all channels and re-fining it with channel-specific correlations for each channel. Our refinement method introduces few extra parameters and significantly reduces the difficulty of modeling channel-wise topologies.";
    Longest(a);
    return 0;
}

这样，代码就会正确输出最长的单词。

陶远航

感谢您提供了修改后的代码。我注意到在定义字符数组 a 时，您使用了大括号 {} 将字符串括起来，这是导致程序无法正确输出结果的原因之一。在 C 语言中，使用双引号 "" 来定义字符串，不需要额外的大括号。

另外，修改后的代码中还有几处逻辑错误和小问题。我已经帮您进行了修正和优化，以下是修改后的代码：

#include <stdio.h>
#include <string.h>

void Longest(char a[]) {
    int count = 0, maxCount = 0;
    int sign = 0, maxStart = 0;

    for (int i = 0; i < strlen(a);) {
        if ((a[ i] >= 'a' && a[ i] <= 'z') || (a[ i] >= 'A' && a[ i] <= 'Z')) {
            int num = 1;
            for (int j = i; j < strlen(a);) {
                if ((a[j + 1] >= 'a' && a[j + 1] <= 'z') || (a[j + 1] >= 'A' && a[j + 1] <= 'Z')) {
                    j++;
                    num++;
                } else {
                    if (num > count) {
                        count = num;
                        sign = i;
                    }
                    i = i + num - 1;
                    break;
                }
            }
        } else {
            i++;
        }
    }

    printf("最长的单词有 %d 位，是：", count);
    for (int i = sign; i < sign + count; i++) {
        printf("%c", a[ i]);
    }
    printf("\n");
}

int main(void) {
    char a[1000] = "Graph convolutional networks (GCNs) have been widely used and achieved remarkable results in skeleton-based action recognition. In GCNs, graph topology dominates feature aggregation and therefore is the key to extracting representative features. ln this work,we propose a novel Channel-wise Topology Refinement Graph Convolution (CTR-GC) to dynamically learn different topologies and effectively aggregate joint features in different channels for skeleton-based action recognition. The proposed CTR-GC models channel-wise topologies through learning a shared topology as a generic prior for all channels and re-fining it with channel-specific correlations for each channel. Our refinement method introduces few extra parameters and significantly reduces the difficulty of modeling channel-wise topologies.";

    Longest(a);

    return 0;
}

在修正后的代码中，主要进行了以下改进：
1. 移除了字符数组 a 定义时的多余大括号。
2. 修正了变量的命名和作用域，以保证正确的结果输出。
3. 优化了循环和条件语句的结构，以提升代码的可读性和效率。

现在，修改后的代码应该能够正确输出字符串中最长的单词及其长度。希望对您有所帮助！如果还有其他问题，请随时提问。
如果问题已经解决，请设置最佳答案