function factorial(n){
return n*factorial(n-1)
}
複製代碼
解答:javascript
function factorial(n){
return n > 1 ? n * factorial(n-1) : 1;
}
複製代碼
function greatestCommonDivisor(a,b){
//在這裏編寫代碼
}
greatestCommonDivisor(8, 12) //4
greatestCommonDivisor(8, 16) //8
greatestCommonDivisor(8, 17) //1
複製代碼
解答:java
function greatestCommonDivisor(a,b){
  var num=0;
while(b!=0){
num=a%b;
a=b;
b=num;
}
return a;
}
複製代碼
Array.prototype.uniq = function () {
var resArr = [];
var flag = true;
for(var i=0;i<this.length;i++){
if(resArr.indexOf(this[i]) == -1){
if(this[i] != this[i]){
//排除 NaN
if(flag){
resArr.push(this[i]);
flag = false;
}
}else{
resArr.push(this[i]);
}
}
}
return resArr;
}
複製代碼
function fibonacci(n) {
if(n ==1 || n == 2){
return 1
}
return fibonacci(n - 1) + fibonacci(n - 2);
}
複製代碼
輸入描述:數組
namespace({a: {test: 1, b: 2}}, 'a.b.c.d')app
輸出描述:dom
{a: {test: 1, b: {c: {d: {}}}}}函數
function namespace(oNamespace, sPackage) {
var properties = sPackage.split('.');
var parent = oNamespace;
for (var i = 0, lng = properties.length; i < lng; ++i) {
var property = properties[i];
if (Object.prototype.toString.call(parent[property])!== '[object Object]') {
parent[property] = {};
}
parent = parent[property];
}
return oNamespace;
}
複製代碼
function bindThis(f, oTarget) {
return function(){
var parames = Array.prototype.slice.call(arguments);
return f.apply(oTarget,parames); //注意這裏須要返回f的執行結果
}
}
複製代碼
查找兩個節點的最近的一個共同父節點,能夠包括節點自身優化
輸入描述:ui
oNode1 和 oNode2 在同一文檔中,且不會爲相同的節點this
function commonParentNode(oNode1, oNode2) {
if(oNode1.contains(oNode2)){
return oNode1;
}else if(oNode2.contains(oNode1)){
return oNode2;
}else{
return commonParentNode(oNode1.parentNode,oNode2);
}
}
複製代碼
關係型數組:spa
var obj = [
{ id:3, parent:2 },
{ id:1, parent:null },
{ id:2, parent:1 },
]
複製代碼
指望結果:
o = {
obj: {
id: 1,
parent: null,
child: {
id: 2,
parent: 1,
child: {
id: ,3,
parent: 2
}
}
}
}
複製代碼
實現源碼:
function treeObj(obj) {
obj.map(item => {
if (item.parent !== null) {
obj.map(o => {
if (item.parent === o.id) {
if (!o.child) {
o.child = [];
}
o.child.push(item);
o.child = o.child;
}
});
}
});
return obj.filter(item => item.parent === null)[0]
}
複製代碼
或者:
function treeObj(obj) {
return obj.sort((a, b) => b.parent - a.parent)
.reduce((acc, cur) => (acc ? { ...cur, child: acc } : cur));
}
複製代碼
// 當出現連續數字的時候以‘-’輸出
[1, 2, 3, 4, 6, 8, 9, 10]
複製代碼
指望結果:
["1-4", 6, "8-10"]
複製代碼
實現代碼:
判斷是否連續:
var arrange = function(arr){
var result = [],temp = [];
arr.sort(function(source, dest){
return source - dest;
}).concat(Infinity).reduce(function(source, dest){
temp.push(source);
if(dest-source > 1){
result.push(temp);
temp = [];
}
return dest;
});
return result;
};
複製代碼
格式化實現:
var formatarr = function(arr) {
var newArr = []
var arr1 = arrange(arr)
for (var i in arr1) {
var str = '';
if (arr1[i].length > 1) {
str = arr1[i][0] + '-' + arr1[i][arr1[i].length - 1];
newArr.push(str)
} else {
newArr.push(arr1[i][0]);
}
}
return newArr;
}
複製代碼
父類:
function People(name,age){
this.name=name;
this.age=age;
this.say=function(){
console.log("個人名字是:"+this.name+"我今年"+this.age+"歲!");
};
}
複製代碼
原型繼承:
function Child(name, age){
this.name = name;
this.age = age;
}
Child.prototype = new People();
var child = new Child('Rainy', 20);
child.say()
複製代碼
構造函數繼承:
function Child(name, age){
People.call(this)
this.name = name;
this.age = age;
}
var child = new Child('Rainy', 20);
child.say()
複製代碼
組合繼承:
function Child(name, age){
People.call(this);
this.name = name;
this.age = age;
}
Child.prototype = People.prototype;
var child = new Child('Rainy', 20);
child.say()
複製代碼
組合繼承優化:
function Child(name, age){
People.call(this);
this.name = name;
this.age = age;
}
Child.prototype = Object.create(People.prototype);
Child.prototype.constructor = Child;
var child = new Child('Rainy', 20);
child.say()
複製代碼