问：判断两个字符串是否为同位字符的程序

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

如果两个字符串包含相同的字符，则称它们是同位字符。但是，字符的顺序或序列可以不同。在此程序中，我们的任务是检查两个字符串是否为同位字符。为此，我们遵循一个更简单的方法。首先，比较字符串的长度，如果长度不相等，则打印错误消息并退出，否则，将字符串转换为小写以方便比较。使用冒泡排序或其他排序方法对两个字符串进行排序。如果排序后发现字符串相同，则打印字符串是同位字符，否则打印字符串不是同位字符。

算法

定义两个字符串。
检查它们的长度。如果长度不相等，则字符串不是同位字符。
否则，将字符串转换为小写字符以便于比较。
一些语言允许提供内置函数来对字符串进行排序。如果没有，则将其转换为字符数组进行排序。
对数组进行排序。
最后，检查内容是否相等。

解决方案

Python

str1 = "Grab";
str2 = "Brag"; 
#Checking for the length of strings
if(len(str1)!= len(str2)):
    print ("Both the strings are not anagram");
else:
    #Converting the strings to lower case
    str1 = str1.lower();
    str2 = str2.lower();
    #Sorting the strings
    str1 = ''. join(sorted(str1));
    str2 = ''. join(sorted(str2));
    
    if (str1 == str2):
        print ("Both the strings are anagram"); 
    else:
        print ("Both the strings are not anagram");

输出

Both the strings are anagram.

C

#include <stdio.h>
#include <string.h>
void toLowercase(char[]);
void sortArray(char[]);
int main ()
{
    char str1[] = "Grab", str2[] = "Brag";
    int i, j = 0;
    
    //Checking for the length of strings
    if(strlen(str1) != strlen(str2)){
        printf("Both the strings are not anagram");
        return 0;
    }
    else {
    //converting the string to lowercase
    toLowercase(str1);
    toLowercase(str2);
    
    //Sorting the arrays by making call to user defined function sortArray()
    sortArray(str1);
    sortArray(str2);
    
    for(i = 0; i < strlen(str1); i++){
       if(str1[i] != str2[i]){
           printf("Both the strings are not anagram");
           return 0;
       } 
    }   
    printf("Both the strings are anagram");
    }
    return 0;
}
void toLowercase(char a[]){
            int i;
            for(i = 0; i < strlen(a)-1; i++){
                a[i] = a[i]+32;
            }    
        }
 void sortArray(char a[]){
            int temp = 0,i,j;
            for(i = 0; i < strlen(a)-1; i++){
                for (j = i+1; j < strlen(a); j++){
                if(a[i] > a[j]) {
                    temp = a[i];
                    a[i] = a[j];
                    a[j] = temp;       
                    }
                }
            }   
        }

输出

Both the strings are anagram.

JAVA

import java.util.Arrays;
public class Anagram {    
    public static void main (String [] args) {        
        String str1="Brag";
        String str2="Grab";
        
        //Converting both the string to lower case.
        str1 = str1.toLowerCase();
        str2 = str2.toLowerCase();
        
        //Checking for the length of strings
        if (str1.length() != str2.length()) {
            System.out.println("Both the strings are not anagram");
        }
        else {
            //Converting both the arrays to character array
            char[] string1 = str1.toCharArray();
            char[] string2 = str2.toCharArray();
            
            //Sorting the arrays using in-built function sort ()
            Arrays.sort(string1);
            Arrays.sort(string2);
            
            //Comparing both the arrays using in-built function equals ()
            if(Arrays.equals(string1, string2) == true) {
                System.out.println("Both the strings are anagram");
            }
            else {
                System.out.println("Both the strings are not anagram");
            }
        }
    }
}

输出

Both the strings are anagram.

C#

using System;
public class Program
{
    public static void Main ()
    {
        string str1="Brag";
        string str2="Grab";
        
        //Converting both the string to lower case and then removing white spaces.
        str1 = str1.ToLower();
        str2 = str2.ToLower();
        
        //Checking for the length of strings
        if(str1.Length != str2.Length) {
            Console.WriteLine("Both the strings are not anagram");
        }
 
        else { 
            //Converting both the arrays to character array
            char[] string1 = str1.ToCharArray();
            char[] string2 = str2.ToCharArray();
            
            //Sorting the arrays using in-built function sort ()
            Array.Sort(string1);
            Array.Sort(string2);
            
            //Comparing both the strings using in-built function equals ()
            if(string1.ToString().Equals(string2.ToString())) {
                Console.WriteLine("Both the strings are anagram");
            }
            else {
                Console.WriteLine("Both the strings are not anagram");
            }
        }
    }
}

输出

Both the strings are anagram.

PHP

<!DOCTYPE html>
<html>
<body>
<?php
    $str1 = "Grab";
    $str2 = "Brag";
    
    //Checking for the length of strings
    if(strlen($str1) != strlen($str2)){
        echo "Both the strings are not anagram";
    }
    else{
        //Convert strings to lower case
        $str1 = strtolower($str1);
        $str2 = strtolower($str2);
    
        //Splitting the array to convert it into array
        $str1array = str_split($str1);
        $str2array = str_split($str2);
    
        //Sorting arrays of character
        sort($str1array);
        sort($str2array);
    
        //Joining the characters from array to convert it into single string
        $str1 = implode("",$str1array);
        $str2 = implode("",$str2array);

        //Comparing two strings, it returns 0 when the strings are equal else -1
        if(strcmp($str1,$str2) == 0){
            echo "Both the strings are anagram";
        }
        else{
            echo "Both the strings are not anagram";
        }
    }
?>
</body>
</html>

输出

Both the strings are anagram.

下一个主题程序列表

问：判断两个字符串是否为同位字符的程序

算法

解决方案

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 的程序

确定所有叶子是否在同一级别的程序

确定一个字符串是否为另一个字符串的旋转的程序

程序列表 | 编程示例

构建二叉搜索树并执行删除和中序遍历的程序

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

对单链表元素进行排序的程序

创建包含 N 个节点的双向链表并计算节点数量的程序

编写计算六边形周长的程序

计算五边形面积的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器