E-COM-NET
首页
在线工具
Layui镜像站
SUI文档
联系我们
推荐频道
Java
PHP
C++
C
C#
Python
Ruby
go语言
Scala
Servlet
Vue
MySQL
NoSQL
Redis
CSS
Oracle
SQL Server
DB2
HBase
Http
HTML5
Spring
Ajax
Jquery
JavaScript
Json
XML
NodeJs
mybatis
Hibernate
算法
设计模式
shell
数据结构
大数据
JS
消息中间件
正则表达式
Tomcat
SQL
Nginx
Shiro
Maven
Linux
algorithms
Java面试资源
www.importnew.com/cat/career 代码面试最常用的10大算法 http://www.csdn.net/article/2014-04-10/2819237-Top-10-
Algorithms
-for-Coding-Interview
darrenzhu
·
2014-02-21 11:00
java
面试
题集
interview
Java面试资源
http://www.importnew.com/cat/career代码面试最常用的10大算法http://www.csdn.net/article/2014-04-10/2819237-Top-10-
Algorithms
-for-Coding-InterviewJAVA8
darrenzhu
·
2014-02-21 11:00
面试
java
题集
interview
Java面试资源
www.importnew.com/cat/career 代码面试最常用的10大算法 http://www.csdn.net/article/2014-04-10/2819237-Top-10-
Algorithms
-for-Coding-Interview
darrenzhu
·
2014-02-21 11:00
java
面试
interview
题集
Swap Nodes in Pairs
swapeverytwoadjacentnodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Your
algorithms
houlduseonlyconstantspace.Youmay
u012653791
·
2014-02-20 23:00
LeetCode
LeetCode 136 — Single Number（C++ Java Python）
single-number/Givenanarrayofintegers,everyelementappearstwiceexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitw
lilong_dream
·
2014-02-20 15:27
LeetCode
【索引】Designing Efficient
Algorithms
：Exercises: Beginner
AOAPCI:BeginningAlgorithmContests--TrainingGuide(RujiaLiu)Chapter1.AlgorithmDesign::DesigningEfficient
Algorithms
u011328934
·
2014-02-20 10:00
【索引】Designing Efficient
Algorithms
：Examples
AOAPCI:BeginningAlgorithmContests--TrainingGuide(RujiaLiu)Chapter1.AlgorithmDesign::DesigningEfficient
Algorithms
u011328934
·
2014-02-20 09:00
【索引】Designing Efficient
Algorithms
AOAPCI:BeginningAlgorithmContests--TrainingGuide(RujiaLiuChapter1.AlgorithmDesign::DesigningEfficient
Algorithms
ExamplesExamples
u011328934
·
2014-02-20 09:00
算法复杂度
plain-english-explanation-of-big-ohttp://bigocheatsheet.com/http://www.sitepoint.com/time-complexity-
algorithms
Wuaner
·
2014-02-19 15:00
algorithm
算法复杂度
plain-english-explanation-of-big-o http://bigocheatsheet.com/ http://www.sitepoint.com/time-complexity-
algorithms
Wuaner
·
2014-02-19 15:00
Algorithm
算法复杂度
plain-english-explanation-of-big-o http://bigocheatsheet.com/ http://www.sitepoint.com/time-complexity-
algorithms
Wuaner
·
2014-02-19 15:00
Algorithm
算法复杂度
plain-english-explanation-of-big-o http://bigocheatsheet.com/ http://www.sitepoint.com/time-complexity-
algorithms
Wuaner
·
2014-02-19 15:00
Algorithm
Single Number II
阅读更多Givenanarrayofintegers,everyelementappearsthreetimesexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
wadefall
·
2014-02-19 15:00
WIFI连接
privateWifiConfigurationcreateWifiInfo(ScanResultscanResult){ WifiConfigurationconfig=newWifiConfiguration(); config.allowedAuth
Algorithms
.clear
wyl530274554
·
2014-02-18 17:00
[LeetCode]Single Number
题目描述Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
cjllife
·
2014-02-18 15:00
[LeetCode]Single Number II
题目说明Givenanarrayofintegers,everyelementappearsthreetimesexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
Leo-Yang
·
2014-02-17 19:00
Range Minimum Query and Lowest Common Ancestor
Static&d1=tutorials&d2=lowestCommonAncestor Introduction Notations RangeMinimumQuery(RMQ) Trivial
algorithms
forRMQ
JDPlus
·
2014-02-16 11:00
算法
table
动态规划
segment
trees
sparse
【温故而知新】C和C++4:STL概览
从组织上来看，STL可分为六大部分，分别是迭代器(iterators)、算法(
algorithms
)、容器（container）、函数对象(functionobject)、内存分配器(allocator
shaqoneal
·
2014-02-15 20:00
Algorithm
数据结构
STL
Programmer Study Guide-游戏程序员指南
《Introductionto
Algorithms
》第二版 中文名《算法导论》关 于算法的标准
zhangty0223
·
2014-02-13 23:00
设计模式
游戏
程序员
操作系统
开源代码
First Missing Positive
Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your
algorithms
houldrunin
u012653791
·
2014-02-12 21:00
LeetCode
CLRS 4.2 Exercises
4.2-2 WritepseudocodeforStrassen's
algorithmS
TRASSEN(A,B) n=A.rows letCbeanewn*nmatrices ifn==1 C11=a11
_jerrywu
·
2014-02-11 18:00
CLRS-4.2
C++语言学习之STL 的组成
STL有三大核心部分：容器（Container）、算法（
Algorithms
）、迭代器（Iterator），容器适配器（containeradaptor），函数对象(functor)，除此之外还有STL
杨坤乾
·
2014-02-11 14:00
C++
算法
vector
iterator
Class
语言
java数据结构和算法学习之汉诺塔示例
复制代码代码如下:packagecom.tiantian.
algorithms
;/***_|_1||*__|__2||*___|___3||(1).把A上的4个木块移动到C上。
·
2014-02-10 09:13
LeetCode(137)Single NumberII
题目如下:Givenanarrayofintegers,everyelementappearsthreetimesexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
feliciafay
·
2014-02-09 10:27
C++
LeetCode(137)Single NumberII
题目如下:Givenanarrayofintegers,everyelementappearsthreetimesexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
feliciafay
·
2014-02-09 10:00
比特操作
CLRS 4.1 EXERCISES
4Supposewechangethedefinitionofthemaximumsubarrayproblemtoallowtheresulttobeanemptysubarray,wherethesumofthevaluesofanemptysubarrayis0.Howwouldyouchangeanyofthe
algorithms
thatdonotallowemptysubarra
_jerrywu
·
2014-02-08 17:00
算法
CLRS-CH4
Algorithm Design :: Designing Efficient
Algorithms
:: Examples
链接：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=460点击题目进入题解： TitleTotalSubmissions/Solving%TotalUsers/Solving%11462 - AgeSort2471336.09%622788.47%11078 - OpenCreditSys
u011217342
·
2014-02-07 06:00
计算机科学中最重要的32个算法
本文转自：http://www.infoq.com/cn/news/2012/08/32-most-important-
algorithms
奥地利符号计算研究所（ResearchInstituteforSymbolicComputation
Mars_NAVY
·
2014-02-05 22:00
[LeetCode]First Missing Positive,解题报告
Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given[1,2,0]return3,and[3,4,-1,1]return2.Your
algorithms
houldruninO
zinss26914
·
2014-02-05 16:00
OCP-1Z0-053-200题-151题-53
QUESTION151YouwanttouseRMANtocreatecompressedbackups.Whichstatementistrueaboutthecompression
algorithms
thatRMANcanuse
rlhua
·
2014-02-04 23:00
LeetCode OJ:Swap Nodes in Pairs
swapeverytwoadjacentnodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Your
algorithms
houlduseonlyconstantspace.Youmay
starcuan
·
2014-01-30 21:00
LeetCode
LeetCode OJ:First Missing Positive
Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your
algorithms
houldrunin
starcuan
·
2014-01-30 00:00
LeetCode
[LeetCode]24.Swap Nodes in Pairs
swapeverytwoadjacentnodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Your
algorithms
houlduseonlyconstantspace.Youmay
SunnyYoona
·
2014-01-29 17:00
LeetCode
面试
校园招聘
剑指offer
[LeetCode]24.Swap Nodes in Pairs
swapeverytwoadjacentnodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Your
algorithms
houlduseonlyconstantspace.Youmay
SunnyYoona
·
2014-01-29 17:00
LeetCode
面试
校园招聘
剑指offer
Cracking the coding interview--Q1.7
题目原文：Writean
algorithms
uchthatifanelementinanMxNmatrixis0,itsentirerowandcolumnissetto0.译文：写一个算法使一个MxN
Mars_NAVY
·
2014-01-26 23:00
找到单独的数字 Single Number
Givenanarrayofintegers,everyelementappearstwiceexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
fox64194167
·
2014-01-26 18:00
[LeetCode]*137.Single Number II
【题目】Givenanarrayofintegers,everyelementappears three timesexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
SunnyYoona
·
2014-01-26 16:00
LeetCode
面试
校园招聘
剑指offer
LeetCode 题解（7）：First Missing Positive
Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given[1,2,0]return3,and[3,4,-1,1]return2.Your
algorithms
houldruninO
u011029779
·
2014-01-25 16:00
Algorithm
LeetCode
LeetCode OJ:Single Number
21027MySubmissionsGivenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexit
starcuan
·
2014-01-19 22:00
LeetCode
异或
MapReduce的模式、算法和用例
原文 http://juliashine.com/mapreduce-patterns-
algorithms
-and-use-cases/在这篇文章里总结了几种网上或者论文中常见的MapReduce模式和算法
woshigaosi
·
2014-01-19 19:29
mapreduce
hadoop
KNN的一些总结
顾名思义，就是K-Nearestneighbors
Algorithms
的简称。我们可能都知道最近邻算法，它就是KNN算法在k=1时的特例，也就是寻找最近的邻居。
ctsm
·
2014-01-19 12:00
入门
机器学习
实例
knn
k近邻
误差
最近邻
通俗
KD树
KNN的一些总结
顾名思义，就是K-Nearestneighbors
Algorithms
的简称。我们可能都知道最近邻算法，它就是KNN算法在k=1时的特例，也就是寻找最近的邻居。
chucuoyuan7276
·
2014-01-19 12:00
斯坦福ML公开课笔记11——贝叶斯正则化、在线学习、ML应用建议
ML经验包括算法的诊断(Diagnosticsfordebugginglearning
algorithms
)、误差分析(erro
xinzhangyanxiang
·
2014-01-19 11:00
机器学习
在线学习
贝叶斯正则化
Opencv 棋盘定位（源码调试2）
很可惜，网上基本上没有这方面的资料，在opencv原文件中的提示：The
algorithms
developedandimplementedbyVezhnevet
b5w2p0
·
2014-01-18 11:00
源码
opencv
图像处理
Leetcode Blog Post
Algorithms
packageleetcode.blog; importjava.util.ArrayList; importjava.util.Arrays; publicclassLeetcodeBlog{ //Q1FindIntersectionoftwoSortedArrays //ifeitherAorB'slengthistoobig,trytouseBinarySearchshouldbe //
violet_program
·
2014-01-18 04:00
算法经典书籍推荐
2.
Algorithms
算法概论短小精悍，别据一格，准经典之作。一个坏消息:同算法导论，该书没有习题答案。好消息：习题很经典，难度也适中，只需花点点时
HNFXS985
·
2014-01-15 10:53
数据结构&算法
算法经典书籍推荐
2.
Algorithms
算法概论短小精悍，别据一格，准经典之作。一个坏消息:同算法导论，该书没有习题答案。好消息：习题很经典，难度也适中，
WaitForFree
·
2014-01-15 10:00
基于物品的协同过滤推荐算法——读“Item-Based Collaborative Filtering Recommendation
Algorithms
”<转>
“Item-BasedCollaborativeFilteringRecommendation
Algorithms
”这篇是推荐领域比较经典的论文，现在很多流行的推荐算法都是在这篇论文提出的
yongjian_luo
·
2014-01-14 13:00
学习笔记2：c++位运算-异或运算
SingleNumber Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
starcuan
·
2014-01-13 23:00
uva 270 - Lining Up
不过这个题目以前在上普林斯顿的
algorithms
里有个大程跟这个95%相似的问题，所以我一下子就想到了优化的解法，复杂度是O( (n^2)logn )。
249326109
·
2014-01-13 17:00
ini
上一页
113
114
115
116
117
118
119
120
下一页
按字母分类：
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
其他