翎羽飘的小分享

这三个都是用来储存一堆数据的，set和map在算法题中多用于查找，总结一下用法和区别1. arrayvar a = ['A', 'B', 'C'];  2. set：一组key的集合，没有value。key不能重复，set无重复值var s = new Set(['A', 'B', 'C']); 1）s.add('d')2）s.delete('d')3. map： 一组键值

For a web developer, it is very important to know how to design a web page's size. So, given a specific rectangular web page’s area, your job by now is to design a rectangular web page, whose length L

389. Given two strings s and t which consist of only lowercase letters.String t is generated by random shuffling string s and then add one more letter at a random position.Find the letter

1. 树：由一组以边连接的节点组成二叉树：特殊的树，子节点数不超过两个。一个父节点的两个子节点分别称为做节点和右节点。相对较小的值保存在左节点中，相对较小的值保存在右节点中。2. 实现二叉树1）node类：保存数据、和其他节点的链接2）BST类： function Node(data, left, right) { this.data = data; t

1. 创建：1）创建图类2）创建顶点类3）创建边类function Graph(v) { this.vertices = v; this.edges = 0; this.adj = []; for (var i = 0; i < this.vertices; ++i) { this.adj[i] = []; this.ad

啊啊啊，刺猬书的动态规划看的一知半解，，怎么用！！！晕死了。。稍微做一下记录，后面再看看会不会有更好的理解呢~1. 什么是动态规划？与递归相反，从底部解决问题，将所有的小问题解决掉，然后合并成一个整体解决方案，从而解决掉整个大问题。（感觉就是针对数组的各种操作，用数组替代递归的操作，因为递归每次都要算一遍，耗时）1）斐波那契数列function dynFib(n) { va

Related to question Excel Sheet Column TitleGiven a column title as appear in an Excel sheet, return its corresponding column number.For example: A -> 1 B -> 2 C -> 3 ...

Given a string, find the first non-repeating character in it and return it's index. If it doesn't exist, return -1.Examples:s = "leetcode"return 0.s = "loveleetcode",return 2.思路：若要查找整个字符串是

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.思路：这个是在网上找的答案，所以归纳为转载，有关二叉树真的不会。。。

You are given two arrays (without duplicates) nums1 and nums2 where nums1’s elements are subset of nums2. Find all the next greater numbers for nums1's elements in the corresponding places of nums

Write a function that takes a string as input and returns the string reversed.Example:Given s = "hello", return "olleh"./** * @param {string} s * @return {string} */var reverseString = f

Given an array of size n, find the majority element. The majority element is the element that appears more than ⌊ n/2 ⌋ times.You may assume that the array is non-empty and the majority element

You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be the

最近开始刷leetcode算法啦，但是作为一个研究生转专业保研的宝宝，算法实在渣渣，c++也不是很擅长，就刷一下js的版本吧，答案又少，在这记录下来自己刷过题目的答案吧，但是肯定不是最好的办法

Given an array nums, write a function to move all 0's to the end of it while maintaining the relative order of the non-zero elements.For example, given nums = [0, 1, 0, 3, 12], after calling you

Given an array and a value, remove all instances of that value in place and return the new length.Do not allocate extra space for another array, you must do this in place with constant memory.

Given a sorted array, remove the duplicates in place such that each element appear only once and return the new length.Do not allocate extra space for another array, you must do this in place with

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 ma

Given an array of integers, return indices of the two numbers such that they add up to a specific target.You may assume that each input would have exactly one solution, and you may not use the sam

Reverse a singly linked list./** * Definition for singly-linked list. * function ListNode(val) { * this.val = val; * this.next = null; * } *//** * @param {ListNode} head * @return {

Given a non-negative integer num, repeatedly add all its digits until the result has only one digit. For example:Given num = 38, the process is like: 3 + 8 = 11, 1 + 1 = 2. Since 2 has o

嘿嘿，刷题刷个520~~Given a word, you need to judge whether the usage of capitals in it is right or not.We define the usage of capitals in a word to be right when one of the following cases holds:

决定以后刷题一定要记下来整个思路，方便以后看

Given an integer array with even length, where different numbers in this array represent different kinds of candies. Each number means one candy of the corresponding kind. You need to distribute t