[编程题] 判断回文字符转

递归

function isPalindrome(s: string): boolean {
    if (s.length === 0 || s.length === 1) {
        return true
    }

    if (s.charAt(0) === s.charAt(s.length - 1)) {
        return isPalindrome(s.substring(1, s.length - 1))
    }

    return false
}

const s = 'racecar'

console.log(isPalindrome(s)) // true

循环

function isPalindrome(s: string): boolean {
    let l = 0, r = s.length - 1
    while (l < r) {
        if (s.charAt(l) === s.charAt(r)) {
            l++
            r--
        } else {
            return false
        }
    }
    return true
}