basic algorithm- 20190416-20190425
binary search
14.https://www.lintcode.com/problem/first-position-of-target/description
74.https://www.lintcode.com/problem/first-bad-version/description
Tree
97.https://www.lintcode.com/problem/maximum-depth-of-binary-tree/description
480.https://www.lintcode.com/problem/binary-tree-paths/description
596.https://www.lintcode.com/problem/minimum-subtree/description
93.https://www.lintcode.com/problem/balanced-binary-tree/description
578.https://www.lintcode.com/problem/lowest-common-ancestor-iii/description
95.https://www.lintcode.com/problem/validate-binary-search-tree/description
BFS
69.https://www.lintcode.com/problem/binary-tree-level-order-traversal/description 70.71
7.https://www.lintcode.com/problem/serialize-and-deserialize-binary-tree/description
178.https://www.lintcode.com/problem/graph-valid-tree/description
127.https://www.lintcode.com/problem/topological-sorting/description 拓扑
433.https://www.lintcode.com/problem/number-of-islands/description
432.https://www.lintcode.com/problem/connected-component-in-undirected-graph/description
DFS
135.https://www.lintcode.com/problem/combination-sum/description
153.https://www.lintcode.com/problem/combination-sum-ii/description 选代表条件： i>0 && num[i]==num[i-1] && i!=index
136.https://www.lintcode.com/problem/palindrome-partitioning/description
15.https://www.lintcode.com/problem/permutations/description 排列
16.https://www.lintcode.com/problem/permutations-ii/description 选代表条件：i>0 && nums[i]==nums[i-1] && visited[i-1]=false
list
65.https://www.lintcode.com/problem/median-of-two-sorted-arrays/description
twoSum:
100.https://www.lintcode.com/problem/remove-duplicates-from-sorted-array/description
101.https://www.lintcode.com/problem/remove-duplicates-from-sorted-array-ii/description could do 2nd time
604.https://www.lintcode.com/problem/window-sum/description
415.https://www.lintcode.com/problem/valid-palindrome/description
891.https://www.lintcode.com/problem/valid-palindrome-ii/description
56.https://www.lintcode.com/problem/two-sum/description
609.https://www.lintcode.com/problem/two-sum-less-than-or-equal-to-target/description
608.https://www.lintcode.com/problem/two-sum-ii-input-array-is-sorted/description
607.https://www.lintcode.com/problem/two-sum-iii-data-structure-design/description
57.https://www.lintcode.com/problem/3sum/description
59.https://www.lintcode.com/problem/3sum-closest/description
918.https://www.lintcode.com/problem/3sum-smaller/description
382.https://www.lintcode.com/problem/triangle-count/description
31.https://www.lintcode.com/problem/partition-array/description
373.https://www.lintcode.com/problem/partition-array-by-odd-and-even/description
148.https://www.lintcode.com/problem/sort-colors/description
143.https://www.lintcode.com/problem/sort-colors-ii/description
heap&hash
129.https://www.lintcode.com/problem/rehashing/description reharshing
134.https://www.lintcode.com/problem/lru-cache/description LRU Cache
517.https://www.lintcode.com/problem/ugly-number/description
4.https://www.lintcode.com/problem/ugly-number-ii/description
54.https://www.lintcode.com/problem/top-k-largest-numbers/description
545.https://www.lintcode.com/problem/top-k-largest-numbers-ii/description
612.https://www.lintcode.com/problem/k-closest-points/description
104.https://www.lintcode.com/problem/merge-k-sorted-lists/description
81.https://www.lintcode.com/problem/find-median-from-data-stream/description
401.https://www.lintcode.com/problem/kth-smallest-number-in-sorted-matrix/description
DP:
109.https://www.lintcode.com/problem/triangle/description
110.https://www.lintcode.com/problem/minimum-path-sum/description
114.https://www.lintcode.com/problem/unique-paths/description
115.https://www.lintcode.com/problem/unique-paths-ii/description
679.https://www.lintcode.com/problem/unique-paths-iii/description
111.https://www.lintcode.com/problem/climbing-stairs/description
1054.https://www.lintcode.com/problem/min-cost-climbing-stairs/description
116.https://www.lintcode.com/problem/jump-game/description 解答：http://www.cnblogs.com/yuzhangcmu/p/4039840.html
117.https://www.lintcode.com/problem/jump-game-ii/description resolve:http://www.cnblogs.com/yuzhangcmu/p/4148858.html DP&Greedy
76.https://www.lintcode.com/problem/longest-increasing-subsequence/description LIS
1093.https://www.lintcode.com/problem/number-of-longest-increasing-subsequence/description
basic algorithm- 20190416-20190425的更多相关文章
- FreeCodeCamp 的 Basic Algorithm Scripting 题解（1）
这是本人的原创文章,转载请注明原文链接http://www.cnblogs.com/wusuowiaaa1blog/p/5932121.html. 1.Reverse a String 翻转字符串 先 ...
- Bubble sort of sorting algorithm
Bubble sort,It's a relatively basic algorithm.The core implementation ideas are as follows: 1.Define ...
- Nagle's Algorithm and TCP_NODELAY
w非全尺寸分组的发送条件 HTTP The Definitive Guide TCP has a data stream interface that permits applications to ...
- CartO
Carto documentation The following is a list of properties provided in CartoCSS that you can apply to ...
- 【JUC】JDK1.8源码分析之SynchronousQueue（九）
一.前言 本篇是在分析Executors源码时,发现JUC集合框架中的一个重要类没有分析,SynchronousQueue,该类在线程池中的作用是非常明显的,所以很有必要单独拿出来分析一番,这对于之后 ...
- Back-propagation, an introduction
About Contact Subscribe Back-propagation, an introduction Sanjeev Arora and Tengyu Ma • Dec 20, ...
- Java多线程系列--“JUC集合”05之 ConcurrentSkipListMap
概要 本章对Java.util.concurrent包中的ConcurrentSkipListMap类进行详细的介绍.内容包括:ConcurrentSkipListMap介绍ConcurrentSki ...
- A trip through the Graphics Pipeline 2011_06_(Triangle) rasterization and setup
Welcome back. This time we’re actually gonna see triangles being rasterized – finally! But before we ...
- Cognition math based on Factor Space (2016.05)
Cognition math based on Factor Space Wang P Z1, Ouyang H2, Zhong Y X3, He H C4 1Intelligence Enginee ...
- js中字符和数组一些基本算法题
最近在刷 fcc的题,跟升级打怪一样,一关一关的过,还挺吸引我的.今天抽时间把 Basic Algorithm Scritping 这部分题做了,根据一些提示,还是比较简单的.有些题的处理方式 方法 ...
随机推荐
- 看图说话：关于BI那点事儿
[编者按]BI=DW+数据挖掘+业务分析+社会学?BI三部曲:管数据.看数据.源数据.BI有三种放法:技术部.业务部和独立部门.BI的工作=20%数据平台+30%数据支持+50%数据应用.
- Redis数据结构（四）
存储list: list存储方式采用头和尾插入的方式,这样效率快,如果没有这个插入的数据,redis自己会创建这个数据,如果是中间插入的话,采用list方式效率就会很慢. ArrayList使用数组方 ...
- 【笔记】metasploit渗透测试魔鬼训练营-信息搜集
exploit 漏洞利用代码 编码器模块:免杀.控制 help [cmd] msfcli适合对网络中大量系统统一测试. 打开数据包路由转发功能:/etc/sysctl.conf /etc/rc.loc ...
- 如何提取kinect中深度图的点云数据
https://bbs.csdn.net/topics/391080654 在Matlab中调用Kinect教程:https://jingyan.baidu.com/article/af9f5a2d1 ...
- java数据结构和算法03（队列和优先级队列）
什么是队列呢?其实队列跟栈很像,我们可以把栈的底部给弄开,这样数据就可以从下面漏出来了,我们就从下面拿就好了. 可以看到队列是新进先出,就跟我们显示生活中的排队一样,买火车票,飞机票等一样,先去的肯定 ...
- gvim 全屏 插件
1.这里下载插件zip解压后,将fullscreen.dll放到gvim.exe同目录下 2.执行 :call libcallnr()//切换全屏模式 3.上面的命令非常麻烦,可以在_vimrc中ma ...
- Tempdb--查看tempdb使用的脚本
GO /****** Object: StoredProcedure [dbo].[usp_GetTempDBUsedSpace] Script Date: 03/05/2014 13:24:42 * ...
- Oracle数据库01
常用函数 COUNT(*):统计所有的数据量,没有过滤功能 COUNT(字段):统计出指定字段不为null的数据量,有过滤功能 COUNT(DISTINCT 字段):统计指定字段不为空并且去掉重复数据 ...
- case when then end 用法
select type,numbers,case monthst when 1 then '一月'when 2 then '二月'when 3 then '三月'else '其他月'end month ...
- windows挂载网络盘
@echo offset filename=%DATE:~0,4%%DATE:~5,2%%DATE:~8,2%set filename="DataBak-%filename%"ne ...