参考链接:https://docs.google.com/spreadsheet/pub?key=0Aqt--%20wSNYfuxdGxQWVFsOGdVVWxQRlNUVXZTdEpOeEE&output=html ID Question Diff Freq Data Structure Algorithms                                   1 Two Sum 2 5 array sort           set Two Pointers   2 Add…

转载自:LeetCode Question Difficulty Distribution                 1 Two Sum 2 5 array sort           set Two Pointers   2 Add Two Numbers 3 4 linked list Two Pointers             Math   3 Longest Substring Without Repeating Characters 3 2 string Two Poin…

转载自:LeetCode Question Difficulty Distribution               1 Two Sum 2 5 array sort         set Two Pointers 2 Add Two Numbers 3 4 linked list Two Pointers           Math 3 Longest Substring Without Repeating Characters 3 2 string Two Pointers      …

Id Question Difficulty Frequency Data Structures Algorithms 1 Two Sum 2 5 array + set sort + two pointers 2 Add Two Numbers 3 4 linked list two pointers + math 3 Longest Substring Without Repeating Characters 3 2 string + hashtable two pointers 4 Med…

Leetcode难度表及解题汇总 参考网上一份题目难度表,以及本人的解题. Id Question Difficulty Frequency Data Structures Algorithms Blog Comment 1 Two Sum 2 5 array+set sort+2ptr 2 Add Two Numbers 3 4 linkedlist math+2ptr Leetcode解题-链表(2.2.1)AddTwoNumbers 3 Longest Substring Without…

Sept. 22, 2015 学一道算法题, 经常回顾一下. 第二次重温, 决定增加一些图片, 帮助自己记忆. 在网上找他人的资料, 不如自己动手. 把从底向上树的算法搞通俗一些. 先做一个例子: 9/22/2015 Go over one example to build some muscle memory about this bottom up, O(1) solution to find the root node in subtree function. Sorted List: 1…

August 2, 2015 在http://zzk.cnblogs.com/ 用"找一找", 花了几个小时, 找出比较好的Leetcode博客． Read the leetcode question and solutions: 1. Find lowest common ancestor in binary tree: blog of a facebook programmer working on leetcode questions: 递归版本:空间O(1),时间O(n) ht…

697. Degree of an Array - LeetCode Question 697. Degree of an Array - LeetCode Solution 理解两个概念: 数组的度:[1,2,2,3,1]这个数组,去重后的元素为[1,2,3],每个元素在原数组中重复的次数分别是221,数组的度就是元素最大重复次数,这个数组中元素最大重复次数就是2 连续子数组:和字符串中的了串概念类似,数组元素顺序保持不变,取其中一部分,该题就是求在度相同的情况下最小连续子数组的长度 思路:数…

项目演示 项目演示 项目源码 项目源码 教程说明 本教程适合对Vue基础知识有一点了解,但不懂得综合运用,还未曾使用Vue从头开发过一个小型App的读者.本教程不对所有的Vue知识点进行讲解,而是手把手一步步从0到1,做出一个完整的小项目.目前网上的教程不是只有零散的知识点讲解:就是抛出一个开源的大项目,初级读者下载下来后,运行起来都很费劲,更谈不上理解这个项目是如何一步步开发出来的了.本教程试图弥补这个空白. 1. 项目初始化 1.1使用 Vue CLI 创建项目 如果你还没有安装 VueCL…

Here is a difficulty and frequency distribution chart for each problem (which I got from the Internet and is very useful). Dynamic Programming Edit Distance Maximum Subarray Minimum Path Sum Unique Paths Unique Paths II Longest Palindromic Substring…

shit LeetCode interview Question https://leetcode.com/interview/1/ 有点晕,啥意思,没太明白,到底是要按什么排序呀? 去掉 标识符 不去掉,TMD 也不对呀 难道... const uniqueKey = arr.slice(1).join(` `).replace(/[0-9]/g, ``); // const uniqueKey = arr.join(` `).replace(/[0-9]/g, ``); /** * @par…

题目 Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. 翻译 合并k个有序的链表 Hints Related Topics: LinkedList, Divide and Conquer, Heap Solution1:Divide and Conquer 参考 归并排序-维基百科 思路:分治,先分成两个子任务,然后递归子任务,最后回溯回来..这里就…

题目 Determine whether an integer is a palindrome. Do this without extra space. Some hints: Could negative integers be palindromes? (ie, -1) If you are thinking of converting the integer to string, note the restriction of using extra space. You could a…

题目 The string "PAYPALISHIRING" is written in a zigzag pattern on a given number of rows like this: (you may want to display this pattern in a fixed font for better legibility) P A H N A P L S I I G Y I R And then read line by line: "PAHNAPL…

Question: Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i]. Solve it without division and in O(n). For example, given [1,2,3,4], return [24,1…

Write a program to find the n-th ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 1, 2, 3, 4, 5, 6, 8, 9, 10, 12 is the sequence of the first 10 ugly numbers. Note that 1 is typically treated as an…

Write a program to check whether a given number is an ugly number. Ugly numbers are positive numbers whose prime factors only include 2, 3, 5. For example, 6, 8 are ugly while 14 is not ugly since it includes another prime factor 7. Note that 1 is ty…

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 only one digit, return it. Follow up:Could you do it without any…

Given n non-negative integers a1, a2, ..., an, where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a containe…

题意:给你一个字符串和行数numRows,要求把该字符串变成一个"之"字形状后,按行数输出该字符串. 例子:"ABCDEFGHIJKLMNO", 4. 该字符串的"之"字形状为: A G M B F H L N C E I K O D J 那么,输出为AGMBFHLNCEIKODJ (按行数输出) 思路:数学推导公式.在字符串中,有两行是特殊的,那就是第一行和最后一行.   第一行和最后一行,字符都是在一竖上,且字符之间相距的距离都是diff =…

题意:给你一个整数,计算该整数的二进制形式里有多少个“1”.比如6(110),就有2个“1”. 一开始我就把数字n不断右移,然后判定最右位是否为1,是就cnt++,否则就继续右移直到n为0. 可是题目说了是无符号整数,所以给了2147483648,就WA了. 因为java里的int默认当做有符号数来操作,而2147483648超过int的最大整数,所以在int里面其实是当做-1来计算的. 那么,不能在while里面判断n是否大于0,和使用位操作符>>.应该使用位操作符>>>,…

在递归调用的函数中使用了max = INT_MIN,结果报超时错误,改为max=0就对了,虽然在这题中最小就为0, 看来在之后最小为0的时候,就不要使用INT_MIN了.…

题目 Given a linked list, reverse the nodes of a linked list k at a time and return its modified list. k is a positive integer and is less than or equal to the length of the linked list. If the number of nodes is not a multiple of k then left-out nodes…

题目 Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 翻译 合并两个有序的链表 Hints Related Topics: LinkedList 参考 归并排序-维基百科,可以递归也可以迭代,基本的链表操作 代码 Java /** * Definition for…

题目 Given an array S of n integers, find three integers in S such that the sum is closest to a given number, target. Return the sum of the three integers. You may assume that each input would have exactly one solution. For example, given array S = {-1…

题目 Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: [ "((()))", "(()())", "(())()", "()(())", "()()()" ]…

题目大意:给一个矩阵,将其按顺时针旋转90°. 题目分析:通法是先将矩阵转置,然后再反转每一行,或者是先反转每一列,然后再将其转置.I just want to say"It's amazing!".(forgivig my poor English!) 代码如下(代码怎么写已经不重要了!): class Solution { public: void rotate(vector<vector<int>>& matrix) { int r=matrix.…

题目 Given an array S of n integers, are there elements a, b, c in S such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero. Note: The solution set must not contain duplicate triplets. For example, given array S = [-…

题目 Implement regular expression matching with support for '.' and '*'. '.' Matches any single character. '*' Matches zero or more of the preceding element. The matching should cover the entire input string (not partial). The function prototype should…

题目 Given a string containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. The brackets must close in the correct order, "()" and "()[]{}" are all valid but "(]" and "([)]&q…