打印给定字符串中最小和最大的回文单词的程序

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

说明

在此程序中，我们需要找到给定字符串中存在的最小和最大的回文字符串。

在上面的例子中，"wow" 是最小的回文字符串，"kayak" 是最大的回文字符串。完成此任务的一种方法是将字符串分割成单词。然后，检查单词是否是回文。然后，比较它们的长度以找出最小和最大的回文字符串。

算法

定义一个字符串。
将字符串转换为小写，以使其不区分大小写。
在末尾添加一个额外的空格。
现在，迭代字符串直到找到空格，并将这些字符添加到变量 `word` 中。将每个单词添加到 `words` 数组。`words` 数组将包含字符串中的所有单词。
`isPalindrome()` 函数将从前向后迭代字符串，一次比较一个字符。如果没有匹配，则将标志设置为 `false`。如果标志为 `true`，则该字符串是回文。如果标志为 `false`，则该字符串不是回文。
迭代 `words` 数组，并通过调用 `isPalindrome()` 来检查单词是否是回文。如果一个单词是回文，则计数器加 1。计数器用于检查字符串中是否存在回文字符串。
当找到第一个回文字符串时，将 `smallPalin` 和 `bigPalin` 设置为第一个回文字符串。
当找到下一个回文字符串时，检查该回文字符串的长度是否小于 `smallPalin`。如果是，则将该单词存储在 `smallPalin` 中。
如果下一个回文字符串的长度大于 `bigPalin`。如果是，则将该单词存储在 `bigPalin` 中。
最后，如果计数为 0，则表示没有回文字符串。否则，显示最小和最大的回文字符串。

解决方案

Python

#isPalindrome() checks whether a string is palindrome or not
def isPalindrome(a):
    flag = True;
    #Iterate the string forward and backward and compare one character at a time
    #till middle of the string is reached
    for i in range(0, len(a)//2):
        if(a[i] != a[len(a) -i-1]):
            flag = False;
            break;
    return flag;
    
string = "Wow you own kayak";
words = [];
word = "";
count = 0;
 
#Converts the given string into lowercase
string = string.lower();
 
#Add extra space after string to get the last word in the given string
string = string + " ";
 
for i in range(0, len(string)):
    #Split the string into words
    if(string[i] != ' '):
        word = word + string[i];
    else:
        #Add word to array words
        words.append(word);
        #Make word an empty string
        word = "";
        
#Determine the smallest and biggest palindromes in a given string
for i in range(0, len(words)):
    if(isPalindrome(words[i])):
        
        count = count + 1;
        #When first palindromic word is found
        if(count == 1):
            #Initialize smallPalin and bigPalin with first palindromic word
            smallPalin = bigPalin = words[i];
            
        #Compare smallPalin and bigPalin with each palindromic words
        else:
            #If length of smallPalin is greater than next palindromic word
            #Store that word in smallPalin
            if(len(smallPalin) > len(words[i])):
                smallPalin = words[i];
                
            #If length of bigPalin is less than next palindromic word
            #Store that word in bigPalin
            if(len(bigPalin) < len(words[i])):
                bigPalin = words[i];
 
if(count == 0):
    print("No palindrome is present in the given string");
else:
    print("Smallest palindromic word: " + smallPalin);
    print("Biggest palindromic word: " + bigPalin);

输出

Smallest palindromic word: wow
Biggest palindromic word: kayak

C

#include <stdio.h>
#include <stdbool.h>
#include <string.h>
 
//isPalindrome() checks whether a string is palindrome or not
bool isPalindrome(char a[]){
    bool flag = true;
    //Iterate the string forward and backward and compare one character at a time 
    //till middle of the string is reached
    for(int i = 0; i < strlen(a)/2; i++){
        if(a[i] != a[strlen(a)-i-1]){
            flag = false;
            break;
        }
    }
    return flag;
}
 
int main()
{   
    char string[] = "Wow you own kayak";
    char words[100][100], smallPalin[100], bigPalin[100];
    int i = 0, j = 0, k, length, count = 0;
    
    //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'){
            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;
    
    //Determine the smallest and biggest palindromes in a given string
    for(int i = 0; i < length; i++){
        if(isPalindrome(words[i])){
            
            count++;
            //When first palindromic word is found
            if(count == 1){
                //Initialize smallPalin and bigPalin with first palindromic word
                strcpy(smallPalin, words[i]);
                strcpy(bigPalin, words[i]);
            }
            
            //Compare smallPalin and bigPalin with each palindromic words
            else{
                //If length of smallPalin is greater than next palindromic word 
                //Store that word in smallPalin
                if(strlen(smallPalin) > strlen(words[i]))
                    strcpy(smallPalin, words[i]);
                    
                //If length of bigPalin is less than next palindromic word 
                //Store that word in bigPalin
                if(strlen(bigPalin) < strlen(words[i]))
                    strcpy(bigPalin, words[i]);
            }
        }
    }
    
    if(count == 0)
        printf("No palindrome is present in the given string");
    else{
        printf("Smallest palindromic word: %s\n", smallPalin);
        printf("Biggest palindromic word: %s", bigPalin);
    }
    
    return 0;
}

输出

Smallest palindromic word: wow
Biggest palindromic word: kayak

JAVA

public class SmallestBiggestPalindrome
{
    //isPalindrome() checks whether a string is palindrome or not
    public static boolean isPalindrome(String a){
        boolean flag = true;
        //Iterate the string forward and backward and compare one character at a time 
        //till middle of the string is reached
        for(int i = 0; i < a.length()/2; i++){
            if(a.charAt(i) != a.charAt(a.length()-i-1)){
                flag = false;
                break;
            }
        }
        return flag;
    }
    
    public static void main(String[] args){
        String string = "Wow you own kayak";
        String word = "", smallPalin = "", bigPalin="";
        String[] words = new String[100];
        int temp = 0, count = 0;
        
        //Converts the given string into lowercase
        string = string.toLowerCase();
        
        //Add extra space after string to get the last word in the given string
        string = string + " ";
        
        for(int i = 0; i < string.length(); i++){
            //Split the string into words
            if(string.charAt(i) != ' '){
                word = word + string.charAt(i);
            }
            else{
                //Add word to array words
                words[temp] = word;
                //Increment temp
                temp++;
                //Make word an empty string
                word = "";
            }
        }
        
        //Determine the smallest and biggest palindromes in a given string
        for(int i = 0; i< temp; i++){
            if(isPalindrome(words[i])){
                
                count++;
                //When first palindromic word is found
                if(count == 1)
                    //Initialize smallPalin and bigPalin with first palindromic word
                    smallPalin = bigPalin = words[i];
                
                //Compare smallPalin and bigPalin with each palindromic words
                else{
                    //If length of smallPalin is greater than next palindromic word 
                    //Store that word in smallPalin
                    if(smallPalin.length() > words[i].length())
                        smallPalin = words[i];
                        
                    //If length of bigPalin is less than next palindromic word 
                    //Store that word in bigPalin
                    if(bigPalin.length() < words[i].length())
                        bigPalin = words[i];
                }
            }
        }
        
        if(count == 0)
            System.out.println("No palindrome is present in the given string");
        else{
            System.out.println("Smallest palindromic word: " + smallPalin);
            System.out.println("Biggest palindromic word: " + bigPalin);
        }
    }
}

输出

Smallest palindromic word: wow
Biggest palindromic word: kayak

C#

using System;
                    
public class SmallestBiggestPalindrome
{    
    //isPalindrome() checks whether a string is palindrome or not
    public static Boolean isPalindrome(String a){
        Boolean flag = true;
        //Iterate the string forward and backward and compare one character at a time 
        //till middle of the string is reached
        for(int i = 0; i < a.Length/2; i++){
            if(a[i] != a[a.Length-i-1]){
                flag = false;
                break;
            }
        }
        return flag;
    }
    
    public static void Main()
    {
        String string1 = "Wow you own kayak";
        String word = "", smallPalin = "", bigPalin="";
        String[] words = new String[100];
        int temp = 0, count = 0;
        
        //Converts the given string into lowercase
        string1 = string1.ToLower();
        
        //Add extra space after string1 to get the last word in the given string
        string1 = string1 + " ";
        
        for(int i = 0; i < string1.Length; i++){
            //Split the string into words
            if(string1[i] != ' '){
                word = word + string1[i];
            }
            else{
                //Add word to array words
                words[temp] = word;
                //Increment temp
                temp++;
                //Make word an empty string
                word = "";
            }
        }
        
        //Determine the smallest and biggest palindromes in a given string
        for(int i = 0; i< temp; i++){
            if(isPalindrome(words[i])){
                
                count++;
                //When first palindromic word is found
                if(count == 1)
                    //Initialize smallPalin and bigPalin with first palindromic word
                    smallPalin = bigPalin = words[i];
                
                //Compare smallPalin and bigPalin with each palindromic words
                else{
                    //If length of smallPalin is greater than next palindromic word 
                    //Store that word in smallPalin
                    if(smallPalin.Length > words[i].Length)
                        smallPalin = words[i];
                        
                    //If length of bigPalin is less than next palindromic word 
                    //Store that word in bigPalin
                    if(bigPalin.Length < words[i].Length)
                        bigPalin = words[i];
                }
            }
        }
        
        if(count == 0)
            Console.WriteLine("No palindrome is present in the given string");
        else{
            Console.WriteLine("Smallest palindromic word: " + smallPalin);
            Console.WriteLine("Biggest palindromic word: " + bigPalin);
        }
    }
}

输出

Smallest palindromic word: wow
Biggest palindromic word: kayak

PHP

<!DOCTYPE html>
<html>
<body>
<?php
//isPalindrome() checks whether a string is palindrome or not
function isPalindrome($a){
    $flag = true;
    //Iterate the string forward and backward and compare one character at a time 
    //till middle of the string is reached
    for($i = 0; $i < strlen($a)/2; $i++){
        if($a[$i] != $a[strlen($a)-$i-1]){
            $flag = false;
            break;
        }
    }
    return $flag;
}
 
$string = "Wow you own kayak";
$word = "";
$words = array();
$count = 0;
 
//Converts the given string into lowercase
$string = strtolower($string);
 
//Add extra space after string to get the last word in the given string
$string = $string . " ";
 
for($i = 0; $i < strlen($string); $i++){
    //Split the string into words
    if($string[$i] != ' '){
        $word = $word . $string[$i];
    }
    else{
        //Add word to array words
        array_push($words, $word);
        //Make word an empty string
        $word = "";
    }
}
 
//Determine the smallest and biggest palindromes in a given string
for($i = 0; $i< count($words); $i++){
    if(isPalindrome($words[$i])){
        
        $count++;
        //When first palindromic word is found
        if($count == 1)
            //Initialize smallPalin and bigPalin with first palindromic word
            $smallPalin = $bigPalin = $words[$i];
        
        //Compare smallPalin and bigPalin with each palindromic words
        else{
            //If length of smallPalin is greater than next palindromic word 
     //Store that word in smallPalin
     if(strlen($smallPalin) > strlen($words[$i]))
         $smallPalin = $words[$i];
         
     //If length of bigPalin is less than next palindromic word 
     //Store that word in bigPalin
     if(strlen($bigPalin) < strlen($words[$i]))
         $bigPalin = $words[$i];
    }
}
}
 
if($count == 0)
    print("No palindrome is present in the given string");
else{
    print("Smallest palindromic word: " . $smallPalin);
    print("<br>Biggest palindromic word: " . $bigPalin);
}
?>
</body>
</html>

输出

Smallest palindromic word: wow
Biggest palindromic word: kayak

下一主题#

打印给定字符串中最小和最大的回文单词的程序

说明

算法

解决方案

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

相关帖子

从单链表中查找最大值和最小值节点的程序

打印数组所有元素之和的程序

打印星型图案 10 的程序

将千字节转换为字节和位的程序

编写计算圆锥表面积的程序

计算正方形面积的程序

在二叉树中搜索节点的程序

从单向链表中删除重复元素的程序

计算直角三角形面积的程序

华氏度转摄氏度的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器