leetcode344-反转字符串

反转字符串


力扣链接

题目描述

编写一个函数,其作用是将输入的字符串反转过来。输入字符串以字符数组 s 的形式给出。

不要给另外的数组分配额外的空间,你必须原地修改输入数组、使用 O(1) 的额外空间解决这一问题。

示例 1:

输入:s = ["h","e","l","l","o"]
输出:["o","l","l","e","h"]

示例 2:

输入:s = ["H","a","n","n","a","h"]
输出:["h","a","n","n","a","H"]

提示:

  • 1 <= s.length <= 105
  • s[i] 都是 ASCII 码表中的可打印字符

我的解题思路

使用双指针low和high,low指0索引,high指数组.length - 1索引,然后循环low < high时,交换两个位置的字符,然后low++,high–;

代码

class Solution {
    public void reverseString(char[] s) {
        int low = 0;
        int high = s.length - 1;
        while (low < high) {
            char temp = s[low];
            s[low] = s[high];
            s[high] = temp;
            low++;
            high--;
        }
    }
}

时间复杂度

O(N)

上一篇:常见排序算法实现c语言


下一篇:[机房测试]信息拦截