查找字符串中重复单词的程序

2025年1月8日 | 阅读 4 分钟

说明

在此程序中，我们需要找出字符串中存在的重复单词并显示这些单词。

要从字符串中找出重复的单词，我们首先将字符串分割成单词。然后计算字符串中每个单词的出现次数。如果出现次数大于1，则表明该单词在字符串中有重复。

在上面的示例中，以绿色高亮显示的单词是重复的单词。

算法

定义一个字符串。
将字符串转换为小写，以使比较不区分大小写。
将字符串分割成单词。
将使用两个循环来查找重复的单词。外循环选择一个单词并初始化计数器变量为1。内循环将外循环选择的单词与其余单词进行比较。
如果找到匹配项，则计数器加1，并将重复的单词设置为“0”，以避免再次计算。
内循环结束后，如果一个单词的计数大于1，则表明该单词在字符串中有重复。

解决方案

Python

string = "big black bug bit a big black dog on his big black nose";
 
#Converts the string into lowercase
string = string.lower();
 
#Split the string into words using built-in function
words = string.split(" ");
 
print("Duplicate words in a given string : ");
for i in range(0, len(words)):
    count = 1;
    for j in range(i+1, len(words)):
        if(words[i] == (words[j])):
            count = count + 1;
            #Set words[j] to 0 to avoid printing visited word
            words[j] = "0";
            
    #Displays the duplicate word if count is greater than 1
    if(count > 1 and words[i] != "0"):
        print(words[i]);

输出

 Duplicate words in a given string : 
big
black

C

#include <stdio.h>
#include <string.h>
 
int main()
{   
    char string[] = "big black bug bit a big black dog on his big black nose";
    char words[100][100];
    int i = 0, j = 0, k, length, count;
    
    //Split the string into words such that each row of array words represents a word
    for(k=0; string[k]!='\0'; k++){
        
        //Here, i represents row and j represents column of two-dimensional array words
        if(string[k] != ' ' && string[k] != '\0'){
            //Converts the string into lowercase and add it to array words
            words[i][j++] = tolower(string[k]);
        }
        else{
            words[i][j] = '\0';
            //Increment row count to store new word
            i++;
            //Set column count to 0
            j = 0;
        }
    }
    
    //Store row count in variable length
    length = i+1;
    
    printf("Duplicate words in the given string: \n");
    for(i = 0; i < length; i++){
        count = 1;
        for(j = i+1; j < length; j++){
           if(strcmp(words[i], words[j]) == 0 && (strcmp(words[j],"0") != 0)){
               count++;
               //Set words[j] to 0 to avoid printing visited word
               strcpy(words[j],"0");
           } 
        }
        //Displays the duplicate word if count is greater than 1
        if(count > 1 )
            printf("%s\n", words[i]);
    }
  
    return 0;
}

输出

Duplicate words in a given string : 
big
black

JAVA

public class DuplicateWord {
    public static void main(String[] args) {
        String string = "Big black bug bit a big black dog on his big black nose";
        int count;
        
        //Converts the string into lowercase
        string = string.toLowerCase();
        
        //Split the string into words using built-in function
        String words[] = string.split(" ");
        
        System.out.println("Duplicate words in a given string : "); 
        for(int i = 0; i < words.length; i++) {
            count = 1;
            for(int j = i+1; j < words.length; j++) {
                if(words[i].equals(words[j])) {
                    count++;
                    //Set words[j] to 0 to avoid printing visited word
                    words[j] = "0";
                }
            }
            
            //Displays the duplicate word if count is greater than 1
            if(count > 1 && words[i] != "0")
                System.out.println(words[i]);
        }
    }
}

输出

Duplicate words in a given string : 
big
black

C#

 using System;
                    
public class DuplicateWord
{
    public static void Main()
    {
        String string1 = "Big black bug bit a big black dog on his big black nose";
        int count;
        
        //Converts the string into lowercase
        string1 = string1.ToLower();
        
        //Split the string into words using built-in function
        String[] words = string1.Split(' ');
        
        Console.WriteLine("Duplicate words in a given string : ");
        for(int i = 0; i < words.Length; i++) {
            count = 1;
            for(int j = i+1; j < words.Length; j++) {
                if(words[i].Equals(words[j])) {
                    count++;
                    //Set words[j] to 0 to avoid printing visited word
                    words[j] = "0";
                }
            }
            
            //Displays the duplicate word if count is greater than 1
            if(count > 1 && words[i] != "0")
                Console.WriteLine(words[i]);
        }
    }
}

输出

Duplicate words in a given string : 
big
Black

PHP

<!DOCTYPE html>
<html>
<body>
<?php
$string = "Big black bug bit a big black dog on his big black nose";
$count;
 
//Converts the string into lowercase
$string = strtolower($string);
 
//Split the string into words using built-in function
$words = explode(" ", $string);
 
print("Duplicate words in a given string : <br>");
for($i = 0; $i < count($words); $i++) {
    $count = 1;
    for($j = $i+1; $j < count($words); $j++) {
        if($words[$i] == $words[$j]) {
            $count++;
            //Set words[j] to 0 to avoid printing visited word
            $words[$j] = "0";
        }
    }
    
    //Displays the duplicate word if count is greater than 1
    if($count > 1 && $words[$i] != "0"){
        print($words[$i]);
        print("<br>");
    }
}
?>
</body>
</html>

输出

Duplicate words in a given string : 
big
black

下一主题#

查找字符串中重复单词的程序

说明

算法

解决方案

Python

C

JAVA

C#

PHP

联系信息

关注我们

教程

面试题

在线编译器

Python

Java

.Net Framework

AI, ML and Data Science

Cloud Technology

B.Tech and MCA

Web Technology

PHP

Software Testing

Technical Interview

Java Interview

Python

Web Interview

Database Interview

B.Tech / MCA

Important Interview

Software Testing Interview

Company Interviews

Online Compilers

Multiple Choice Questions

程序

查找字符串中重复单词的程序

说明

算法

解决方案

Python

C

JAVA

C#

PHP

相关帖子

将千米转换为厘米的程序

计算矩阵每行每列之和的程序

计算立方体体积的程序

在双向链表中间插入新节点的程序

将字符串中的空格替换为特定字符的程序

单向链表示例

在循环链表中间插入新节点的程序

将厘米转换为英尺和英寸的程序

编写查找长方体（Rectangular Prism）面积的程序

打印给定数字的组合 (nCr) 的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器