g0301_0400.s0344_reverse_string.Solution Maven / Gradle / Ivy

Go to download

Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java21 Show documentation

Java-based LeetCode algorithm problem solutions, regularly updated

There is a newer version: 1.38

package g0301_0400.s0344_reverse_string;

// #Easy #Top_Interview_Questions #String #Two_Pointers #Recursion #Algorithm_I_Day_4_Two_Pointers
// #Udemy_Strings #2022_07_11_Time_1_ms_(99.91%)_Space_54.4_MB_(64.26%)

/**
 * 344 - Reverse String\.
 *
 * Easy
 *
 * Write a function that reverses a string. The input string is given as an array of characters `s`.
 *
 * You must do this by modifying the input array [in-place](https://en.wikipedia.org/wiki/In-place_algorithm) with `O(1)` extra memory.
 *
 * **Example 1:**
 *
 * **Input:** s = ["h","e","l","l","o"]
 *
 * **Output:** ["o","l","l","e","h"]
 *
 * **Example 2:**
 *
 * **Input:** s = ["H","a","n","n","a","h"]
 *
 * **Output:** ["h","a","n","n","a","H"]
 *
 * **Constraints:**
 *
 * *   1 <= s.length <= 10⁵
 * *   `s[i]` is a [printable ascii character](https://en.wikipedia.org/wiki/ASCII#Printable_characters).
**/
public class Solution {
    public void reverseString(char[] s) {
        int left = 0;
        int right = s.length - 1;
        while (left < right) {
            char tmp = s[left];
            s[left++] = s[right];
            s[right--] = tmp;
        }
    }
}