今日头条基础算法题

面试题汇总:
今日头条:
已知如下类Animal,要求设计一个Cat类继承自Animal,并实现如下功能:

Animal:function Animal(){
    this.name = "Animal";
    this.showName = function(){
        console.log(this.name);
    }
}
 
Cat:function Cat(){
    this.name = "Cat";
    this.showName1 = function(){
        console.log(this.name); 
    }
    this.showName2 = function(){
        console.log(this.name); 
    } 
    this.showName3 = function(){
        console.log(this.__super.name + "=>" + this.name); 
    }
}

代码运行:
// 请完善Cat部分相关代码,得到如下结果:

var cat = new Cat();
console.log(cat instanceof Animal ); // 得到:true
cat.showName1();     // 得到:"Cat" (需要读到Cat中的name属性) 
cat.showName2();    //  得到:”Animal" (需要读到Animal中的name属性) 
cat.showName3();    //得到:”Animal" => "Cat" (需要同时读到Cat中的name和Animal中的name)

解析:

function Animal() {
    this.name = "Animal";
    this.showName = function() {
        console.log(this.name);
    };
}
function Cat() {
    this.name = "Cat";
    this._super = Cat.prototype;
 
    this.showName1 = function() {
        console.log(this.name);
    };
    this.showName2 = function() {
        console.log(this.name);
    };
    this.showName3 = function() {
        console.log(this._super.name + "=>" + this.name);
    };
}
Cat.prototype = new Animal();
var cat = new Cat();
console.log(cat instanceof Animal);   //true
cat.showName1();     //"Cat"
cat.showName2.call(Cat.prototype);   //"Animal"
cat.showName3();    //"Animal" => "Cat"

第二题:
已知道如下数组:

var arr = [[1,2,2],[3, 4, 5, 5],[6, 7, 8, 9,[11,12,[12,13,[14]]]],10];

编写一个程序将数组扁平化去并除其中重复部分数据,最终得到一个升序且不重复的数组:

var res= [1,2,3,4,5,6,7,8,9,10,11,12,13,14]

解析:

/**
 * 解析数组,然后去重,排序
 * @type Array
 */
<strong>//解析数组</strong>
var arr = [[1, 2, 2], [3, 4, 5, 5], [6, 7, 8, 9, [11, 12, [12, 13, [14]]]], 10];
var newArray = [];
function getArray(array) {
    array.forEach(function(e) {
        if (typeof e === "object") {
            getArray(e);
        } else {
            newArray.push(e);
        }
    });
}
getArray(arr);
<strong>//去重</strong>
Array.prototype.distinct = function() {
    return this.reduce(function(newArray1, newValue) {
        if (newArray1.indexOf(newValue) === -1)
            newArray1.push(newValue);
        return newArray1;
    }, []);
};
newArray = newArray.distinct();
<strong>//排序</strong>
newArray.sort(function(a, b) {
    return a - b;
});
console.log(newArray);

第三题:
如下题目存在哪些问题(改错)?

var obj = {
    name: " jsCoder",
    skill: ["css3","html5", "es6", "react", "angular"],
    say: function () {      
        for(var i = 0, len = this.skill.length; i< len; i++){
            setTimeout(function(){
                console.log("No." + i + this.name);
                console.log(this.skill[i]);
                console.log('--------------------------');
            },100);
        }
    }
}
obj.say();

如何得到结果,能想到几种方法:

<span style="font-size:18px;">No.1 jsCoder
css3
--------------------------
No.2 jsCoder
html5
--------------------------
No.3 jsCoder
es6
--------------------------
No.4 jsCoder
react
--------------------------
No.5 jsCoder
angular
-------------------------- </span>

解析:

<span style="font-size:18px;">/**
 * 考察this指向、闭包
 *  
 */
var obj = {
    name: " jsCoder",
    skill: ["css3", "html5", "es6", "react", "angular"],
    say: function() {
        for (var i = 0, len = this.skill.length; i < len; i++) {
            (function() {
                var temp = i;
                setTimeout(function() {
                    console.log("No." + temp + obj.name);
                    console.log(obj.skill[temp]);
                    console.log('--------------------------');
                }, 100);
            })();
        }
    }
};
obj.say();</span>
发布了53 篇原创文章 · 获赞 33 · 访问量 11万+

猜你喜欢

转载自blog.csdn.net/weixin_42966484/article/details/100164283
今日推荐