Python
Java
PHP
IOS
Android
Nodejs
JavaScript
Html5
Windows
Ubuntu
Linux
Leetcode 219. Contains Duplicate II (hashmap 和 sliding window)
Contains Duplicate II Easy Given an integer array nums and an integer k return true if there are two distinct indices i
algorithmdesign
LeetCode
算法
Java
单调队列的学习 - 滑动窗口求最大/小值 (Leetcode 239, Sliding Window Maximum)
这几天在学习单调队列和单调栈 感觉下面几篇博客讲的比较好 http www cnblogs com saywhy p 6726016 html http dping26 blog 163 com blog static 1795662172
algorithmdesign
LeetCode
学习
算法
LintCode 202. Segment Tree Query (线段树经典题!)
Segment Tree Query 中文English For an integer array index from 0 to n 1 where n is the size of this array in the correspon
algorithmdesign
LintCode
LintCode-460. Find K Closest Elements
Find K Closest Elements Given target a non negative integer k and an integer array A sorted in ascending order find the
algorithmdesign
LintCode