字符串反转程序

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

说明

在此程序中，我们需要找到字符串的反转。这可以通过向后迭代字符串并将原始字符串中的每个字符存储到一个新字符串中来完成。

Original string: Dream big
Reverse of the string: big maerD

算法

定义一个字符串和另一个空字符串来存储反转后的字符串。
现在，从最后一个字符开始迭代字符串，并将反转后的字符存储到变量 revString 中。
循环结束后，revString 将保存字符串的反转。

解决方案

Python

string = "Dream big";
#Stores the reverse of given string
reversedStr = "";
 
#Iterate through the string from last and add each character to variable reversedStr
for i in range(len(string)-1, -1, -1):
    reversedStr = reversedStr + string[i];
    
print("Original string: " + string);
#Displays the reverse of given string
print("Reverse of given string: " + reversedStr);

输出

Original string: Dream big
Reverse of given string: gib maerD

C

#include <stdio.h>
#include <string.h>
 
int main()
{
    char string[] = "Dream big";
    //Stores the reverse of given string
    char reversedStr[strlen(string)];
    int j = 0;
    
    //Iterate through the string from last and add each character to variable reversedStr
    for(int i = strlen(string)-1; i >= 0; i--){
        reversedStr[j++] = string[i];
    }
    reversedStr[j] = '\0';
    
    printf("Original string: %s", string);
    //Displays the reverse of given string
    printf("\nReverse of given string: %s", reversedStr);
 
    return 0;
}

输出

Original string: Dream big
Reverse of given string: gib maerD

JAVA

public class Reverse
{
    public static void main(String[] args) {
        String string = "Dream big";
        //Stores the reverse of given string
        String reversedStr = "";
        
        //Iterate through the string from last and add each character to variable reversedStr
        for(int i = string.length()-1; i >= 0; i--){
            reversedStr = reversedStr + string.charAt(i);
        }
        
        System.out.println("Original string: " + string);
        //Displays the reverse of given string
        System.out.println("Reverse of given string: " + reversedStr);
    }
}

输出

Original string: Dream big
Reverse of given string: gib maerD

C#

using System;
                    
public class Reverse
{
    public static void Main()
    {
        String string1 = "Dream big";
        //Stores the reverse of given string
        String reversedStr = "";
        
        //Iterate through the string from last and add each character to variable reversedStr
        for(int i = string1.Length-1; i >= 0; i--){
            reversedStr = reversedStr + string1[i];
        }
        
        Console.WriteLine("Original string: " + string1);
        //Displays the reverse of given string
        Console.WriteLine("Reverse of given string: " + reversedStr);
    }
}

输出

Original string: Dream big
Reverse of given string: gib maerD

PHP

<!DOCTYPE html>
<html>
<body>
<?php
$string = "Dream big";
//Stores the reverse of given string
$reversedStr = "";
 
//Iterate through the string from last and add each character to variable reversedStr
for($i = strlen($string)-1; $i >= 0; $i--){
    $reversedStr = $reversedStr . $string[$i];
}
 
print("Original string: " . $string);
//Displays the reverse of given string
print("<br>Reverse of given string: " . $reversedStr);
?>
</body>
</html>

输出

Original string: Dream big
Reverse of given string: gib maerD

下一主题#

字符串反转程序

说明

算法

解决方案

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

相关帖子

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

从循环链表中删除中间新节点的程序

交换两个数字的程序

将英寸转换为毫米的程序

打印图案 7 的程序

查找具有 N 个键的二叉搜索树的总可能数量的程序

确定两个树是否相同的程序

创建包含 N 个节点的循环链表并以反向顺序显示的程序

显示上三角矩阵的程序

打印数组中重复元素的程序

订阅 Tpoint Tech

联系信息

关注我们

教程

面试题

在线编译器