实现字符串反转 about fe-learning

[Mrcxt]

用for循环是不是要比while好点，逻辑上也更清晰一点

[Mrcxt]

利用栈

String.prototype.str_reverse = function() {
        let stack = [],
            _str = '',
            str = this;

        for (let i = str.length - 1; i >= 0; i--) {
            let s = str[i]
            if (s === '.') {
                while (stack.length) {
                    _str += stack.pop();
                }
                _str += s
            } else {
                stack.push(s);
            }
        }

        while (stack.length) {
            _str += stack.pop();
        }

        return _str
    }

[metroluffy]

利用栈

String.prototype.str_reverse = function() {
        let stack = [],
            _str = '',
            str = this;

        for (let i = str.length - 1; i >= 0; i--) {
            let s = str[i]
            if (s === '.') {
                while (stack.length) {
                    _str += stack.pop();
                }
                _str += s
            } else {
                stack.push(s);
            }
        }

        while (stack.length) {
            _str += stack.pop();
        }

        return _str
    }

赞一个，不过在遇到 .之前是不是可以不用入栈

    for (let i = 0; i < str.length; i++) {
        let s = str[i]
        if (s === '.') {
            stack.push(_str);
            _str = ''
        } else {
            _str += s
        }
    }    

    while (stack.length) {
        _str += '.' + stack.pop();
    }

[Mrcxt]

利用栈

String.prototype.str_reverse = function() {
        let stack = [],
            _str = '',
            str = this;

        for (let i = str.length - 1; i >= 0; i--) {
            let s = str[i]
            if (s === '.') {
                while (stack.length) {
                    _str += stack.pop();
                }
                _str += s
            } else {
                stack.push(s);
            }
        }

        while (stack.length) {
            _str += stack.pop();
        }

        return _str
    }

赞一个，不过在遇到 .之前是不是可以不用入栈

    for (let i = 0; i < str.length; i++) {
        let s = str[i]
        if (s === '.') {
            stack.push(_str);
            _str = ''
        } else {
            _str += s
        }
    }    

    while (stack.length) {
        _str += '.' + stack.pop();
    }

good,第一版的split函数 ＋ 栈 😂

[KennethYo]

头条的面试是不能开辟额外空间

[pigpigever]

我记得字符串是不能被更改的？所以怎么样都会有额外空间吧，感觉这样写更简洁一点

function reverse(str) {
    let res = ''
    for (const word of str) {
        res = word + res
    }
    return res
}