Subscribe to:
Posts (Atom)
Labels
Algorithm
(219)
Lucene
(130)
LeetCode
(97)
Database
(36)
Data Structure
(33)
text mining
(28)
Solr
(27)
java
(27)
Mathematical Algorithm
(26)
Difficult Algorithm
(25)
Logic Thinking
(23)
Puzzles
(23)
Bit Algorithms
(22)
Math
(21)
List
(20)
Dynamic Programming
(19)
Linux
(19)
Tree
(18)
Machine Learning
(15)
EPI
(11)
Queue
(11)
Smart Algorithm
(11)
Operating System
(9)
Java Basic
(8)
Recursive Algorithm
(8)
Stack
(8)
Eclipse
(7)
Scala
(7)
Tika
(7)
J2EE
(6)
Monitoring
(6)
Trie
(6)
Concurrency
(5)
Geometry Algorithm
(5)
Greedy Algorithm
(5)
Mahout
(5)
MySQL
(5)
xpost
(5)
C
(4)
Interview
(4)
Vi
(4)
regular expression
(4)
to-do
(4)
C++
(3)
Chrome
(3)
Divide and Conquer
(3)
Graph Algorithm
(3)
Permutation
(3)
Powershell
(3)
Random
(3)
Segment Tree
(3)
UIMA
(3)
Union-Find
(3)
Video
(3)
Virtualization
(3)
Windows
(3)
XML
(3)
Advanced Data Structure
(2)
Android
(2)
Bash
(2)
Classic Algorithm
(2)
Debugging
(2)
Design Pattern
(2)
Google
(2)
Hadoop
(2)
Java Collections
(2)
Markov Chains
(2)
Probabilities
(2)
Shell
(2)
Site
(2)
Web Development
(2)
Workplace
(2)
angularjs
(2)
.Net
(1)
Amazon Interview
(1)
Android Studio
(1)
Array
(1)
Boilerpipe
(1)
Book Notes
(1)
ChromeOS
(1)
Chromebook
(1)
Codility
(1)
Desgin
(1)
Design
(1)
Divide and Conqure
(1)
GAE
(1)
Google Interview
(1)
Great Stuff
(1)
Hash
(1)
High Tech Companies
(1)
Improving
(1)
LifeTips
(1)
Maven
(1)
Network
(1)
Performance
(1)
Programming
(1)
Resources
(1)
Sampling
(1)
Sed
(1)
Smart Thinking
(1)
Sort
(1)
Spark
(1)
Stanford NLP
(1)
System Design
(1)
Trove
(1)
VIP
(1)
tools
(1)
Popular Posts
-
阿诺快来!mm再次出现 在平面上有n(n> 3)个点,设其中任意三点被包含在单位圆里,证明:n个点也被包含在单位圆里。 呵呵,叫我干什么啊? #4 得分:0 回复于: 2008-09-19 18:22:04 假设有n个小矩形,每个小矩形表示为(L[i],T[i])—(R[i...
-
A.L. Christensen / Getty Images / Flickr Open Want to avoid giving the impression you lack confidence and authority? Avoid these words Thi...
-
题目大意:一根长L厘米的木棍上有n只蚂蚁,每只蚂蚁有个开始的位置和爬行方向,速度为1.当两只蚂蚁相撞后,两者同时掉头继续爬行,求按输入顺序给出每只蚂蚁T秒后的位置后朝向。 解题思路: 1. 每只蚂蚁相撞后同时掉头可以看做对穿而过,关键的问题就在于求位置的变化。 2.按位置从...
-
VisuAlgo was conceptualised in 2011 by Dr Steven Halim as a tool to help his students better understand data structures and algorithms, by...
-
Interpolation search (sometimes referred to as extrapolation search) is an algorithm for searching for a given key value in an indexed array...
-
1. Definition of Minimum Edit Distance Edit Distance 用于衡量两个strings之间的相似性。 两个strings之间的 Minimum edit distance 是指把其中一个string通过编辑(包括插入,删除,替...
-
一个数组,对于某个区间,这个区间的和*这个区间中的最小值=这个区间的计算值。求这个数组中的最大计算值,并任意输出其的一个左右位置。 思路: 维护一个最小单调栈。 对于某个元素: 如果被 弹出 了,说明它最多向右延伸到这里。 对于 进栈 ,如果它的进栈没有造成任何元素的弹出,则...
-
Read full article from 《挑战程序设计竞赛》读书笔记(五)尺取法 | 薛途的博客
-
The 25 Best Places To Take Free Online Computer Science Classes These days, computers dominate our lives, providing the platform by which w...
-
A series of Java Enhancement Proposals (JEPs) has been published on OpenJDK concerning the next major update (Java 9). Previous rumors abou...