本文共 1086 字，大约阅读时间需要 3 分钟。

function Foo(){}Foo.prototype = {value:"bar"}let foo = new Foo();console.log(foo.constructor)

function removeDuplications(nums){  for(let i = 0; i < nums.length-1; i++){    if(nums[i] === nums[i+1]){      nums.splice(i,1);      i--;    }  }  return nums.length;}let nums = [0,0,1,1,1,1,1,1,1,1,1,2,2,3,3,4]

在数组中，当数组长度有变动时候；不要用  let len = nums.length;  提前把数组长度取出；容易出错；

function searchInsert(nums,target){  if(target > nums[nums.length-1]){    return nums.length;  }else if(target < nums[0]){    return 0;  }else if(nums.indexOf(target) != -1){    return nums.indexOf(target);  }else{    let l = 0;    let r = nums.length - 1;    let m = Math.floor((l+r)/2);    while(target < nums[m] || target > nums[m+1]){      if(target < nums[m]){        r = m;        m = Math.floor((r+l)/2);      }else if(target > nums[m+1]){        l = m;        m = Math.floor((r+l)/2);      }    }    return m + 1;  }}let nums = [1,3,5,7];let target = 6;

var searchInsert = function(nums, target) {  for (let i = 0; i < nums.length; i++) {    if (target <= nums[i]) {      return i;    }  }  return nums.length;};

转载地址：http://betzi.baihongyu.com/