arrayEquals(array1, array2) {
        // if array1 or array2 is a falsy value, return
        if (!array1 || !array2)
          return false;
        // compare lengths - can save a lot of time
        if (array1.length != array2.length)
          return false;
        for (var i = 0, l = array1.length; i < l; i++) {
          // Check if we have nested arrays
          if (array1[i] instanceof Array && array2[i] instanceof Array) {
            // recurse into the nested arrays
            if (!this.arrayEquals(array1[i], array2[i]))
              return false;
          } else if (array1[i] instanceof Object && array2[i] instanceof Object) {
            // 比較含有的對(duì)象是否相等
            if (!this.objectEquals(array1[i], array2[i]))
              return false;
          } else if (array1[i] != array[i]) {
            // Warning - two different object instances will never be equal: {x:20} != {x:20}
            return false;
          }
        }
        return true;
      },
      objectEquals(object1, object2) {
        //For the first loop, we only check for types
        for (let propName in object1) {
          //Check for inherited methods and properties - like .equals itself
          //https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/hasOwnProperty
          //Return false if the return value is different
          if (object1.hasOwnProperty(propName) != object2.hasOwnProperty(propName)) {
            return false;
          }
          //Check instance type
          else if (typeof object1[propName] != typeof object2[propName]) {
            //Different types => not equal
            return false;
          }
        }
        //Now a deeper check using other objects property names
        for (let propName in object2) {
          //We must check instances anyway, there may be a property that only exists in object2
          //I wonder, if remembering the checked values from the first loop would be faster or not
          if (object1.hasOwnProperty(propName) != object2.hasOwnProperty(propName)) {
            return false;
          } else if (typeof object1[propName] != typeof object2[propName]) {
            return false;
          }
          //If the property is inherited, do not check any more (it must be equa if both objects inherit it)
          if (!object1.hasOwnProperty(propName))
            continue;

          //Now the detail check and recursion

          //This returns the script back to the array comparing
          /**REQUIRES Array.equals**/
          if (object1[propName] instanceof Array && object2[propName] instanceof Array) {
            // recurse into the nested arrays
            if (!this.arrayEquals(object1[propName], object2[propName]))
              return false;
          } else if (object1[propName] instanceof Object && object2[propName] instanceof Object) {
            // recurse into another objects
            if (!this.objectEquals(object1[propName], object2[propName]))
              return false;
          }
          //Normal value comparison for strings and numbers
          else if (object1[propName] != object2[propName]) {
            return false;
          }
        }
        //If everything passed, let's say YES
        return true;
      }

  var obj1={0:'a',1:'b',2:'c'}
   var obj2={0:'a',1:'b',2:'c'}
   console.log(obj1==obj2)
   console.log(obj1===obj2)

//判斷兩個(gè)對(duì)象是否相同（包含絕對(duì)相等和他們是否有相同的形狀）
 function looseEqual (a, b) {
    if (a === b) { //如果是絕對(duì)相等就直接返回true
    	return true ;
    }
    //如果不是絕對(duì)相等就哦按的他們是否有相同的形狀
    var isObjectA = isObject(a);
    var isObjectB = isObject(b);
    if (isObjectA && isObjectB) {//兩個(gè)均是對(duì)象
      try {
        var isArrayA = Array.isArray(a);
        var isArrayB = Array.isArray(b);
        if (isArrayA && isArrayB) {//如果都是數(shù)組
        	if(a.length === b.length){//如果長度相等
        	    return a.every(function (e, i) {//用every和遞歸來比對(duì)a數(shù)組和b數(shù)組的每個(gè)元素，并返回
	           	  return looseEqual(e, b[i])
	            })
        	}
        	//長度都不等直接返回false
        	return  false;
        } else if (a instanceof Date && b instanceof Date) {//如果是Date 則直接getTime 比較
           return a.getTime() === b.getTime()
        } else if (!isArrayA && !isArrayB) {//對(duì)象的比較
          //拿到兩個(gè)對(duì)象的key
          var keysA = Object.keys(a);
          var keysB = Object.keys(b);
          if(keysA.length === keysB.length){//如果keys相等
          	  return keysA.every(function (key) {//用every和遞歸來比對(duì)a對(duì)象和b對(duì)象的每個(gè)元素值，并返回
	            return looseEqual(a[key], b[key]);
	          })
          }
          //長度都不等直接返回false
          return false;
        } else {
          return false
        }
      } catch (e) {
        return false
      }
    } else if (!isObjectA && !isObjectB) {//如果都不是對(duì)象則按String來處理
        return String(a) === String(b)
    } else {
        return false
    }
  }
  
  function isObject (obj) {
    return obj !== null && typeof obj === 'object'
  }

 //字符
   var str1="abc";
   var str2="abc";
   console.log(looseEqual(str1,str2))
   
   //數(shù)字
   var num1=12222;
   var num2=12222;
   console.log(looseEqual(num1,num2))
   
   //對(duì)象
   var obj1={0:'a',1:'b',2:'c'}
   var obj2={0:'a',1:'b',2:'c'}
   console.log(looseEqual(obj1,obj2))
   
   //對(duì)象嵌套數(shù)組
   var obj1={0:'a',1:'b',2:[1,2,3]}
   var obj2={0:'a',1:'b',2:[1,2,3]}
   console.log(looseEqual(obj1,obj2))
   
  //類數(shù)組
   var a={0:'a',1:'b',2:'c','length':3}
   var b={0:'a',1:'b',2:'c','length':3}
   console.log(looseEqual(a,b))
   
   //數(shù)組
   var list=[1,2,3,4]
   var list1=[1,2,3,4]
   console.log(looseEqual(list,list1))
   
   //數(shù)組嵌套
    list=[1,2,3,[6,7]]
    list1=[1,2,3,[6,7]]
   console.log(looseEqual(list,list1))
   
    //數(shù)組嵌套對(duì)象
    list=[1,2,3,{a:'1',b:'7'}]
    list1=[1,2,3,{a:'1',b:'7'}]
   console.log(looseEqual(list,list1))
   
   var d1 = new Date();
   var d2 = new Date();
   console.log(looseEqual(d1,d2))
   
   var d3 = new Date();
   var d4 ;
   //使用延時(shí)來賦值d4
   setTimeout(function(){
   		d4 = new Date();
   		console.log(looseEqual(d3,d4))
   },1);