Spider--Man

Write a function that takes a string as input and returns the string reversed. 字符串反转/** * @param {string} s * @return {string} */var reverseString = function(s) { return s.split('').reverse().

Given an array of integers, every element appears twice except for one. Find that single one. 整数数组，除了一个元素出现两次，其它均出现一次，求出现一次的值 Note: Your algorithm should have a linear runtime complexity. Could you

Given two arrays, write a function to compute their intersection. 求两个数组的交集Example: Given nums1 = [1, 2, 2, 1], nums2 = [2, 2], return [2, 2].Note: Each element in the result should appear as many ti

Find the missing letter in the passed letter range and return it.If all letters are present in the range, return undefined.判断字符串相邻字符是否连续，若连续返回undefined，否则返回缺失字符function fearNotLetter(str) { var arr

The DNA strand is missing the pairing element. Take each character, get its pair, and return the results as a 2d array.Base pairs are a pair of AT and CG. Match the missing element to the provided char

Translate the provided string to pig latin.Pig Latin takes the first consonant (or consonant cluster) of an English word, moves it to the end of the word and suffixes an “ay”.If a word begins with a vo

Perform a search and replace on the sentence using the arguments provided and return the new sentence.First argument is the sentence to perform the search and replace on.Second argument is the word tha

返回collection内对象包含source对象内所有属性，并且值相等function whatIsInAName(collection, source) { // What's in a name? var arr = []; // Only change code below this line collection.forEach((cur) => { var has

Roman Numeral Converter 把数字转换成罗马数字转换规则function convertToRoman(num) { var a=[["","I","II","III","IV","V","VI","VII","VIII","IX"], ["","X","XX","XXX","XL","L","LX","LXX","LXXX","XC"],

Diff Two Arrays 求两个数组不同的值function diffArray(arr1, arr2) { var newArr = []; // Same, same; but different. var arr1Diff = arr1.filter((cur) => { return arr2.indexOf(cur) === -1; }); var a

Sum All Numbers in a Range 求两个数字间所有数字之和function sumAll(arr) { var min = Math.min(arr[0], arr[1]); var max = Math.max(arr[0], arr[1]); var arrOpen = []; for (var i = min; i<=max; i++){ arrO

Reverse a singly linked list. 反转单向链表解题思路：迭代或递归迭代/** * Definition for singly-linked list. * function ListNode(val) { * this.val = val; * this.next = null; * } *//** * @param {ListNode}

Given an integer, return its base 7 string representation.把一个整数转换成7进制的字符串解题思路：直接toString(7)或除7取余/** * @param {number} num * @return {string} */var convertToBase7 = function(num) { return num.to

Given a binary tree, find its maximum depth. 求二叉树的最大深度 The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. 最大深度是自根节点到最远叶子节点的距离解题思路：函数递归