Study Notes

Study Notes

  • Source
  • WebDesign
  • Javascript

›Intermediate Algorithm Script

Basic Javascript

  • Basic JavaScript Overview

ES6

  • ES6 Overview

Regular expression

  • Regular Expression Overview
  • Lookahead
  • Capture Group

Debugging

  • Debugging Overview

Object Oriented Programming

  • Object Oriented Programming Overview
  • Mixin
  • Closure
  • IIFE

Functional Programming

  • Functional Programming

Basic Algorithm Script

  • Reverse a String
  • Factorialize a Number
  • Find the Longest Word in a String
  • Return Largest Numbers In Arrays
  • Repeat a String
  • Truncate a String
  • Finders Keepers
  • Boo Who
  • Title Case a Sentence
  • Slice and Splice
  • Falsy Bouncer
  • javascript-algorithms-anddata-structures/basic-algorithm-scripting/where-do-i-belong
  • Mutations
  • Chunky Monkey

Intermediate Algorithm Script

  • Sum All Numbers in a Range
  • Diff Two Arrays
  • Seek and Destroy
  • Wherefor Art Thou
  • Spinal Tap Case
  • Search and Replace
  • DNA Pairing
  • Missing letters
  • Sorted Union
  • Convert HTML Entities
  • Sum All Odd Fibonacci Numbers
  • Smallest Common Multiple
  • Drop it
  • Steamroller
  • Binary Agents
  • Everything Be True
  • Arguments Optional
  • Make a Person
  • Map the Debris

Diff Two Arrays

个人思路:

  • 要找出一个数组当中的元素,是否不存在与另一个数组当中,可以使用 Set 数据结构当中的 has() 方法。
function diffArray(arr1, arr2) {
  const arr1Set = new Set(arr1);
  const arr2Set = new Set(arr2);

  const newArr = arr1.filter(element => !arr2Set.has(element))
    .concat(arr2.filter(element => !arr1Set.has(element)));

  // Same, same; but different.
  return newArr;
}

diffArray([1, 2, 3, 5], [1, 2, 3, 4, 5]);

freeCodeCamp 中级思路及高级思路中,巧妙地用到了 ES6 includes() 来判断数组元素是否存在与另一个数组当中。

← Sum All Numbers in a RangeSeek and Destroy →
Copyright © 2019 罗惠东