Leetcode题库面试题2085. 统计出现过一次的公共字符串(python实现)

思路

有手就行 doge

代码

class Solution:
    def countWords(self, words1: List[str], words2: List[str]) -> int:
        ret=0
        for i in words1:
            if words1.count(i)==1 and words2.count(i)==1:
                ret+=1
        return ret

题目变形:统计出现过一次的公共字符数量(c实现)

void WordsStati(char ** words, int wordsSize, int* alpha){
    char *s;
    int flag=0,length=0;
    for(int i=0;i<wordsSize;i++){
        length+=strlen(words[i]);
    }
    s=(char*)malloc(sizeof(char)*length);
    for(int i=0;i<wordsSize;i++){
        for(int j=0;j<strlen(words[i]);j++){
            s[flag++]=words[i][j];
        }
    }
    for(int i=0;i<26;i++){
        alpha[i]=0;
    }
    for(int i=0;i<length;i++){
        alpha[s[i]-'a']+=1;
    }
}

int countWords(char ** words1, int words1Size, char ** words2, int words2Size){
    int alpha_1[26],alpha_2[26];
    int ret,Length,i;
    ret=0;
    WordsStati(words1, words1Size,alpha_1);
    WordsStati(words2, words2Size,alpha_2);
    }
    for(i=0;i<26;i++){
        if(alpha_1[i]==1 && alpha_2[i]==1) ret++;
    }
    return ret;
}