算法题笔记

// 获取1-n阶乘和

function getAllFactory(n) {

var nFactory = 0

let factory = 1

for (let i = 1; i <= n; i++) {

factory *= i

nFactory += factory

}

console.log(nFactory)

}

// 获取"1！+4！(2的平方)+9！(3的平方)+...+n的值

function getFactory(n) {

let factory = 1

for (let i = 1; i <= n; i++) {

factory *= i

}

console.log(factory)

return factory

}

function getAllFactory2(n) {

var nFactory = 0

for (let i = 1; i <= n; i++) {

nFactory += getFactory(i*i)

}

console.log(nFactory)

}

// 杨辉三角形

function printTriangle (n) {

let arr = []

for(var i = 0; i<=n; i++) {

arr[i] = new Array()

for(var j = 0; j<=i; j++) {

if (j === 0 || j === i) {

arr[i][j] = 1

} else {

arr[i][j] = arr[i-1][j] + arr[i-1][j-1]

}

}

}

console.log(arr)

for (var i =0; i < arr.length; i++) {

console.log(arr[i].join(' '))

}

}

// 偷桃

function monkeyQue() {

let i = 1

let fn = 1

while(i<=9) {

fn = 2*fn + 2

i++

}

console.log(fn)

}

var checkRecord = function(s) {

if (s.indexOf('LLL') === -1 && ((s.split('A')).length-1) <= 1){

return true

} else {

return false

}

};

</script>