leetcode : 344. Reverse String

题目标签

string

题目难度

easy

题目地址：

https://leetcode.com/problems/reverse-string/

题目描述:

Write a function that reverses a string. The input string is given as an array of characters char[].

Do not allocate extra space for another array, you must do this by modifying the input array in-place with O(1) extra memory.

You may assume all the characters consist of printable ascii characters.

Example 1:
Input: ["h","e","l","l","o"]
Output: ["o","l","l","e","h"]

Example 2:
Input: ["H","a","n","n","a","h"]
Output: ["h","a","n","n","a","H"]

解题思路

1. 因为题目说给进来的是char类型数组，要求空间复杂度O(1)，所以我想的是：遍历一边数组，将首尾换位置即可，当数组遍历一半的时候，数组即交换位置完成，即可停止。
2. 交换位置的时候，采用一个额外的变量来交换，使得空间复杂度为O(1)。

代码实现

Java

class Solution {
    public void reverseString(char[] s) {
        int middle = s.length >> 1;
        for (int i = 0; i < middle; i++) {
            swap(s, i, s.length - 1 - i);
        }
    }
   
    private void swap(char[] s, int start, int end) {
        char tmp = ' ';
        tmp = s[start];
        s[start] = s[end];
        s[end] = tmp;
    }
}