leetCode:字符串反转

最新推荐文章于 2024-09-22 13:47:41 发布

、YongTing

最新推荐文章于 2024-09-22 13:47:41 发布

阅读量235

点赞数

分类专栏： leetCode

本文链接：https://blog.csdn.net/weixin_38261597/article/details/88687239

版权

leetCode 专栏收录该内容

26 篇文章 0 订阅

订阅专栏

示例 1：

输入：["h","e","l","l","o"]
输出：["o","l","l","e","h"]

示例 2：

输入：["H","a","n","n","a","h"]
输出：["h","a","n","n","a","H"]

java实现：

 public static String reverseString(String s) {
       if (s == null){
           return null;
       }
       char[] charts = s.toCharArray();
       StringBuilder sb = new StringBuilder();
       int len = charts.length;
       for (int i = len-1; i >= 0; i--) {
           sb.append(charts[i]);
       }
       return sb.toString();
   }

public static void main(String[] args){
    String s="hello";
    reverseString(s);
}