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

Missing letters

个人思路:

  • 找出参数的第一个字母,在 26 个字母字符串当中的索引。
  • 参数和索引开始的 26 个字母字符串,逐个字符进行等值比较,发现不同则返回参数中不同的字符。
function fearNotLetter(str) {
  const allLetters = "abcdefghijklmnopqrstuvwxyz";
  const strArr = [...str];
  const firstLetterIndex = allLetters.indexOf(strArr[0])

  let missingLetter

  for (let i = 0; i < strArr.length; i++) {
    if (strArr[i] !== allLetters[i + firstLetterIndex]) {
      missingLetter = allLetters[i + firstLetterIndex]
      break;
    }
  }

  return missingLetter;
}

fearNotLetter("abce");
← DNA PairingSorted Union →
Copyright © 2019 罗惠东