Coder Social home page Coder Social logo

fe-interview-handwrite's Introduction

github-profile

👋 Hey there

I'm mayandev, a front-end developer.

  • 🎸 Play guitar to relax after work
  • ⚽️ Good at ball games, especially soccer
  • 🚴 Enjoy cycling, here is my cycling trip from ShangHai to WuHan
  • ✍️ Write blogs sometimes

fe-interview-handwrite's People

Contributors

cijiugechu avatar lincycode avatar mayandev avatar shadowhusky avatar sheben404 avatar

Stargazers

 avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar  avatar

Watchers

 avatar  avatar  avatar  avatar  avatar

fe-interview-handwrite's Issues

实现Promise.all有个错误

res.length === arr.length
这一句,并不能保证所有promise都resolve了
若res[1]=1,则res.length=2;
但res[0]对应的promise不一定resolve了。

bind的实现不完整

bind函数的返回值里可以传递参数。

我的实现是:

Function.prototype.bindNew = function (context, ...args) {
  return (...newArgs) => this.apply(context, [...args, ...newArgs]);
};

// test
const test = {
  name: "fy",
  showName: function (last: string) {
    console.log(this.name + " is " + last);
  },
};
test.showName("handsome"); // fy is handsome
test.showName.bind({ name: "Mr.fy" })("handsome");
test.showName.bindNew({ name: "Mr.fy" })("handsome");

最长递增子序列不对

仓库里的实现输出是 number 不是 number[],然后 arr 的状态转移也不太对。不知道是题不一样还是写成了别的。

自己实现了一下

function lis(nums: number[]): number[]{
  if (nums.length === 0) return [];
  const arr = new Array(nums.length).fill(1); // 保存以当前位置结尾的最大连续子串长度
  for (let i = 1; i < nums.length; i++) {
    if(nums[i]>nums[i-1]){
      arr[i] = Math.max(arr[i-1] + 1, 1)
    }
  }

  const lastIndex = arr.indexOf(Math.max(...arr))
  return nums.slice(lastIndex + 1 - arr[lastIndex],lastIndex + 1)
}

console.log(lis([1,2,3,2,3,4,5]))

添加注释

可以在代码中添加注释,比如题目背景,原理,一些过程中的注释

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.