leetcode 344. 反转字符串 js实现

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

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

/**
 * @param {character[]} s
 * @return {void} Do not return anything, modify s in-place instead.
 */

//  api 解法
var reverseString = function(s) {
    return s.reverse()
};

// 常规双指针解法
// 规律：s[i]=s[length-1-i]
var reverseString = function(s) {
    let left =0;
    let right = s.length-1;
    while(left<=right){
        // 交换左右两个指针指向的元素
        [s[left],s[right]]= [s[right],s[left]]
        // 两个指针同时靠近
        left++;
        right--;
    }
    return s;
};