手写api bind call apply科里化

Author: wangjieCode

main.js

@@ -1,7 +1,9 @@
 // import './树/Bst'
 
-import './链表/main'
+// import './链表/main'
 
 // import './string/main'
 
-// import './动态规划/main'
+import './动态规划/main'
+
+// import './数组/main'

动态规划/main.js

@@ -1,3 +1,7 @@
 import { climbStairs, jump } from "./爬楼梯问题";
+import { cuttingRope, breakfastNumber } from './切绳子'
+
+// console.log( jump(10), climbStairs(10) )
+
+console.log(breakfastNumber([10,20,5],[5,5,2], 15))
 
-console.log( jump(10), climbStairs(10) )

动态规划/切绳子.js

@@ -0,0 +1,30 @@
+export const cuttingRope = (n) => {
+    const dp = [];
+    dp[0] = dp[1] = dp[2] = 1;
+    for (let i = 2; i <= n ; i++) {
+        for (let j = i; j < i + 1; j++) {
+            console.log( i , dp[i], j)
+            dp[i] = Math.max(dp[i], j * (i - j), j * dp[i - j]);
+        }
+    }
+    return dp[n];
+}
+
+/**
+ * @param {number[]} staple
+ * @param {number[]} drinks
+ * @param {number} x
+ * @return {number}
+ */
+export var breakfastNumber = function(staple, drinks, x) {
+    let num = 0;
+    for(let i = 0; i < staple.length; i ++){
+        const stapleItem = staple[i];
+        if(stapleItem > x) break
+        for(let j = 0; j < drinks.length; j ++){
+            const res = stapleItem + drinks[j];
+            if(res <= x) num++
+        }
+    }
+    return num % 1000000007
+};

动态规划/爬楼梯问题.js

@@ -3,20 +3,20 @@
  * @return {number}
  */
 export var climbStairs = function (n) {
-    const dp = { '1': 1, "2": 2 }
-    return (() => {
+    const dp = { '1': 1, "2": 2 };
+    const compox = (n) => {
         if (dp[n]) {
-            console.log(dp[n])
             return dp[n]
         }
         if (n <= 0) return 0
-        console.log(climbStairs(n - 1) + climbStairs(n - 2))
-        dp[n] = climbStairs(n - 1) + climbStairs(n - 2)
-    })()
+        dp[n] = compox(n - 1) + compox(n - 2)
+        return dp[n]
+    }
+    return compox(n)
 };
 
 export function jump(n) {
-    if (n <= 0) return -1;
+    if (n <= 0) return 0;
     if (n == 1) return 1;
     if (n == 2) return 2;
     return jump(n - 1) + jump(n - 2);

数组/main.js

@@ -0,0 +1,15 @@
+/**旋转数组最小值
+ * @param {number[]} numbers
+ * @return {number}
+ */
+var minArray = function (numbers) {
+    let minValue = numbers[0];
+    for(let i = 1; i <numbers.length; i ++){
+        if(minValue > numbers[i]){
+            return numbers[i]
+        }
+    }
+    return i
+};
+
+console.log( minArray([2,2,2,0,1] ))

笔试题/手写api/call&apply&bind.js

@@ -0,0 +1,38 @@
+
+Function.prototype.myCall = function (...conents) {
+    const fn = this;
+    const _self = conents.shift()
+    _self.fn = fn;
+    return _self.fn(...conents)
+}
+Function.prototype.myApply = function (...conents) {
+    context.fn = this
+    let result;
+    // 判断是否有第二个参数
+    if(conents[1]) {
+        result = context.fn(...conents[1])
+    } else {
+        result = context.fn()
+    }
+    return result
+}
+
+Function.prototype.myBind = function (_self) {
+    _self.fn = this
+    return (...arg) => {
+        return _self.fn(...arg)
+    }
+}
+const obj = {
+    name: "obj"
+}
+
+function test(params) {
+    console.log(this.name) 
+    console.log(params)   
+}
+
+const newTest = test.bind(obj)
+const newTest2 = test.myBind(obj)
+newTest(111)
+newTest2(222)

笔试题/手写api/科里化.js

@@ -0,0 +1,21 @@
+
+function curry(fn, args = []) {
+    var length = fn.length;
+    var args = args || [];
+    return function(...arg){
+        const newArgs = [ ...args, ...arg];
+        if (newArgs.length < length) {
+            return curry(fn,newArgs);
+        }else{
+            return fn(...newArgs);
+        }
+    }
+}
+
+
+let curryTest = curry((a, b, c, d) => {
+    return a+b+c+d
+},[2])
+// console.log( curryTest(1, 2, 3)(4) )//返回10
+console.log( curryTest(1, 2)(4) )//返回10
+// console.log(  curryTest(1, 2)(3, 4) )//返回10

链表/leetcode160相交链表.js

@@ -16,3 +16,25 @@ export var getIntersectionNode = function (headA, headB) {
     }
     return null
 };
+
+/**
+ * @param {ListNode} headA
+ * @param {ListNode} headB
+ * @return {ListNode}
+ */
+ export var getIntersectionNode2 = function (headA, headB) {
+    const visited = new Set();
+    let temp = headA;
+    while (temp !== null) {
+        visited.add(temp);
+        temp = temp.next;
+    }
+    temp = headB;
+    while (temp !== null) {
+        if (visited.has(temp)) {
+            return temp;
+        }
+        temp = temp.next;
+    }
+    return null;
+};

队列/剑指offer06.js

@@ -0,0 +1,36 @@
+var CQueue = function () {
+    this.stack1 = []
+    this.stack2 = []
+};
+
+/** 
+ * @param {number} value
+ * @return {void}
+ */
+CQueue.prototype.appendTail = function (value) {
+    this.stack1.push(value)
+};
+
+/**
+ * @return {number}
+ */
+CQueue.prototype.deleteHead = function () {
+    // 如果第二个栈为空
+    if (this.stack2.length === 0) {
+        while (!this.stack1.length === 0) {
+            this.stack2.push(this.stack1.pop());
+        }
+    }
+    if (this.stack2.length === 0) {
+        return -1;
+    } else {
+        return  this.stack2.pop();
+    }
+};
+
+/**
+ * Your CQueue object will be instantiated and called as such:
+ * var obj = new CQueue()
+ * obj.appendTail(value)
+ * var param_2 = obj.deleteHead()
+ */