LeetCode Solution - Problem Reverse String

  • 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 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"]
  • 1 <= s.length <= 105
  • s[i] is a printable ASCII character.


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;

/* TC: O(n), SC: O(1) */

class Solution:
    def reverseString(self, s: List[str]) -> None:
        Do not return anything, modify s in-place instead.
        s[:] = s[::-1]
        return s

No comments:

Post a Comment

You might also like

Deploy your Django web app to Azure Web App using App Service - F1 free plan

In this post, we will look at how we can deploy our Django app using the Microsoft Azure app service - a free plan. You need an Azure accoun...