acttell的博客

https://www.cnblogs.com/grandyang/p/4465932.html

https://blog.youkuaiyun.com/qq_37933895/article/details/98848977https://blog.youkuaiyun.com/martin_liang/article/details/38685111

http://www.cnblogs.com/grandyang/p/5533305.html

http://www.cnblogs.com/grandyang/p/8343874.html

https://www.cnblogs.com/wuqianling/p/5387099.html

https://www.cnblogs.com/grandyang/p/4896673.html http://www.cnblogs.com/grandyang/p/4465932.html

https://blog.youkuaiyun.com/s634772208/article/details/46729477 https://www.cnblogs.com/grandyang/p/4329128.html https://blog.youkuaiyun.com/sinat_35261315/article/details/78783275

https://www.cnblogs.com/grandyang/p/5487815.html

https://www.cnblogs.com/Kobe10/p/6306183.html

https://blog.youkuaiyun.com/deep_kang/article/details/79611622

https://blog.youkuaiyun.com/sunnyyoona/article/details/43276387

https://www.cnblogs.com/littlepanpc/p/7704776.html

https://www.cnblogs.com/grandyang/p/4329128.html

http://www.cnblogs.com/grandyang/p/4550604.html

http://www.mamicode.com/info-detail-298788.htmlhttps://www.cnblogs.com/zuoyuan/p/3753553.html

https://www.cnblogs.com/grandyang/p/4455109.html

https://www.cnblogs.com/grandyang/p/4395963.html

http://www.cnblogs.com/grandyang/p/6031787.html

https://www.cnblogs.com/grandyang/p/5966473.html

Given a 2D boolean matrix filled with False and True, find the largest rectangle containing all True and return its area.ExampleGiven a matrix:[[1, 1, 0, 0, 1],[0, 1, 0, 0, 1],[0, 0, 1, 1, 1],[...

https://www.cnblogs.com/grandyang/p/5875509.htmlhttps://blog.youkuaiyun.com/javastart/article/details/50610868

数组A中，除了某一个数字x之外，其他数字都出现了三次，而x出现了一次。请给出最快的方法找到x。https://blog.youkuaiyun.com/morewindows/article/details/12684497

Given an array containing n distinct numbers taken from 0, 1, 2, …, n, find the one that is missing from the array.For example,Given nums = [0, 1, 3] return 2.Note:Your algorithm should run in lin...

https://www.cnblogs.com/grandyang/p/4329128.html

https://blog.youkuaiyun.com/u010025211/article/details/49668017

https://blog.youkuaiyun.com/morewindows/article/details/6684558 https://blog.youkuaiyun.com/morewindows/article/details/6709644/ https://blog.youkuaiyun.com/morewindows/article/details/6678165

题目：给定一个数组，代表每天股票的价格，买卖一次找到最大的收益。例子：输入{7,1,5,3,6,4},输出6-1=5思路：动态规划，数组中最大的数对差#include<iostream>#include<vector>using namespace std;int stock_max(vector<int>&

题目：给定一个整数数组，请找出最长连续上升或下降子序列 样例： 给定 [5, 4, 2, 1, 3], 其最长下降连续子序列为 [5, 4, 2, 1]，返回 4. 给定 [5, 1, 2, 3, 4], 其最长上升连续子序列为 [1, 2, 3, 4]，返回 4.思路： 用动态规划解决。 原数组记为a,设置两个数组分别存储递增以及递减连续子序列长度，记为inc...

python大数相乘，时间复杂度O(n^2)1、把数据扔到list里然后逆转，list顺序0~n对应个位、十位...2、创建存储结果list，长度默认为两个被乘数长度之和3、按位相乘，相同竖线位置累加4、结果list从0位开始遍历，如果大于9进位5、结果逆序def mul(n1,n2): n1.reverse() n2.reverse() n3=[] p...

//插入排序执行过程跟踪void insert(int a[], int n){ int i, j; for (i = 1; i < n; i++) {//a[0]到a[i-1]升序，对于每个a[i]，在a[0]至a[i-1]间找位置安放 for (j = i-1; j >= 0;j--) { if (a[j] <

Given an integer n, return 1 - n in lexicographical order.For example, given 13, return: [1,10,11,12,13,2,3,4,5,6,7,8,9].Please optimize your algorithm to use less time and space. The input size may...

Find the contiguous subarray within an array which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4], the contiguous subarray [4,-1,2,1]，the largest sum = 6.思路：动态规划经典,转移方程：...

Given an integer n, generate a square matrix filled with elements from 1 to n2 in spiral order.For example,Given n = 3,You should return the following matrix:[[ 1, 2, 3 ], [ 8, 9, 4 ], [ 7, 6,...

Given the following matrix:[ [ 1, 2, 3 ], [ 4, 5, 6 ], [ 7, 8, 9 ]]You should return [1,2,3,6,9,8,7,4,5].思路：来看第一圈，行左到右-&amp;gt;列上到下-&amp;gt;行右到左-&amp;gt;列下到上，后面一直重复，来四个游标定边界，left,right,up,downwhile终止条件：le...

Suppose a sorted array is rotated at some pivot.(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).You are given a target value to search. If found return its index, otherwise -1.assume no duplica...

| 1 0 0 | | 7 0 0 | | 7 0 0 |AB = | -1 0 3 | x | 0 0 0 | = | -7 0 3 | | 0 0 1 |思路：i x k维度矩阵A与 k x j维度矩阵B 相乘得i x j维度矩阵C，C[i][j]=A[i][0]*B[0][j] +... + A[i][k]*B[k][j]，为...

Given [10, 9, 2, 5, 3, 7, 101, 18],The longest increasing subsequence is [2, 3, 7, 101],therefore the length is 4. there may be more than one LIS combination, it is only necessary to return the le...

Integers in each row are sorted from left to right.The first integer of each row is greater than the last integer of the previous row.Example :Input:matrix = [ [1, 3, 5, 7], [10, 11, 16, ...

Given an integer array, sort it in ascending order. Use quick sort, merge sort, heap sort or any O(nlogn) algorithm.ExampleGiven [3, 2, 1, 4, 5], return [1, 2, 3, 4, 5].https://www.cnblogs.com/gr...

Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.For example,Given [3,2,1,5,6,4] and k = 2, return 5.No...