392. 判断子序列
题目链接
题解
function isSubsequence(s: string, t: string): boolean {
let i = 0, j = 0
while (i < s.length && j < t.length) {
if (s[i] == t[j]) {
i++
j++
} else {
j++
}
}
return i == s.length
};
541. 反转字符串 II
题目链接
反转字符串 II
题解
function swap(str: string, index1: number, index2: number) {
return str.substring(0, index1) + str.substring(index2, index2 + 1) + str.substring(index1 + 1, index2) + str.substring(index1, index1 + 1) + str.substring(index2 + 1);
}
function reverseStr(s: string, k: number): string {
let i: number, j: number, len = s.length, start = 0, end
for (i = 0; start < len; i += 2 * k) {
end = start + 2 * k
if (end > len) end = len
if (end - start <= 2 * k && end - start >= k) {
for (j = start; j < start + ~~(k / 2); ++j) {
s = swap(s, j, 2 * start + k - j - 1)
}
} else {
for (j = start; j < start + ~~((end - start) / 2); ++j) {
s = swap(s, j, end - j + start - 1)
}
}
start = end
}
return s
};
面试题 16.24. 数对和
题目链接
数对和
题解
function pairSums(nums: number[], target: number): number[][] {
let l = 0, r = nums.length - 1, ret = []
nums.sort((a, b) => a - b)
while (l < r) {
let val = nums[l] + nums[r]
if (val > target) {
r--
} else if (val < target) {
l++
} else {
ret.push([nums[l++], nums[r--]])
}
}
return ret
};