/**
* @param {character[]} s
* @return {void} Do not return anything, modify s in-place instead.
*/
var reverseString = function (s) {
let left = 0, right = s.length - 1
while (left < right) {
[s[left], s[right]] = [s[right], s[left]]
left++
right--
}
return s
};
/**
* @param {string} s
* @param {number} k
* @return {string}
*/
var reverseStr = function (s, k) {
const reverseArr = (arr, left, right) => {
while (left < right) {
[arr[left], arr[right]] = [arr[right], arr[left]]
left++
right--
}
}
const arr = s.split('')
for (let i = 0; i < arr.length; i += 2 * k) {
if (arr.length - i - 1 >= k) {
reverseArr(arr, i, i + k - 1)
} else {
reverseArr(arr, i, arr.length - 1)
}
}
return arr.join('')
};
剑指 Offer 05. 替换空格 - 力扣(LeetCode)
/**
* @param {string} s
* @param {number} k
* @return {string}
*/
var reverseStr = function (s, k) {
const reverseArr = (arr, left, right) => {
while (left < right) {
[arr[left], arr[right]] = [arr[right], arr[left]]
left++
right--
}
}
const arr = s.split('')
for (let i = 0; i < arr.length; i += 2 * k) {
if (arr.length - i - 1 >= k) {
reverseArr(arr, i, i + k - 1)
} else {
reverseArr(arr, i, arr.length - 1)
}
}
return arr.join('')
};
/**
* @param {string} s
* @return {string}
*/
var reverseWords = function (s) {
return s.split(" ").filter(item => item !== "").reverse().join(" ")
};
剑指 Offer 58 - II. 左旋转字符串 - 力扣(LeetCode)
/**
* @param {string} s
* @param {number} n
* @return {string}
*/
var reverseLeftWords = function (s, n) {
function reverse(arr, left, right) {
while (left < right) {
[arr[left], arr[right]] = [arr[right], arr[left]]
left++
right--
}
}
const arr = s.split('')
reverse(arr, 0, arr.length - 1)
reverse(arr, 0, arr.length - n - 1)
reverse(arr, arr.length - n, arr.length - 1)
return arr.join('')
};
28. 找出字符串中第一个匹配项的下标 - 力扣(LeetCode)
/**
* @param {string} haystack
* @param {string} needle
* @return {number}
*/
var strStr = function (haystack, needle) {
for (let i = 0; i <= haystack.length - needle.length; i++) {
let index = i
for (let j = 0; j < needle.length; j++) {
if (haystack[index++] !== needle[j]) {
break
}
if (j === needle.length - 1) {
return i
}
}
}
return -1
};