56 lines
1.1 KiB
JavaScript
56 lines
1.1 KiB
JavaScript
|
/*
|
|||
|
|
* @lc app=leetcode id=344 lang=javascript
|
|||
|
|
*
|
|||
|
|
* [344] Reverse String
|
|||
|
|
*
|
|||
|
|
* https://leetcode.com/problems/reverse-string/description/
|
|||
|
|
*
|
|||
|
|
* algorithms
|
|||
|
|
* Easy (62.81%)
|
|||
|
|
* Total Accepted: 409.9K
|
|||
|
|
* Total Submissions: 649.5K
|
|||
|
|
* Testcase Example: '["h","e","l","l","o"]'
|
|||
|
|
*
|
|||
|
|
* 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"]
|
|||
|
|
*
|
|||
|
|
*
|
|||
|
|
*
|
|||
|
|
*
|
|||
|
|
*/
|
|||
|
|
/**
|
|||
|
|
* @param {character[]} s
|
|||
|
|
* @return {void} Do not return anything, modify s in-place instead.
|
|||
|
|
*/
|
|||
|
|
var reverseString = function(s) {
|
|||
|
|
for(let i = 0; i < s.length >> 1; i++) {
|
|||
|
|
const temp = s[i];
|
|||
|
|
s[i] = s[s.length - i - 1];
|
|||
|
|
s[s.length - i - 1] = temp;
|
|||
|
|
}
|
|||
|
|
};
|
|||
|
|
|