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
Generic
Algorithms
概述标准范型算法不依赖任何类型，唯一隐式依赖的情况是，必须能够对元素做比较。我在想每次比如查找失败的时候返回的一般都是容器的末端迭代器，为什么不返回false，设计者是为了表示对原则的恪守，还是有必须这样做的理由呢。范型算法需要容器内元素能够比较，就是要支持==操作，假如不支持的话，还有后备方案，就是需要一个额外参数：实现元素比较的函数名字。算法永远不会执行特定容器提供的操作，这是原则，假如那种容
arctanx
·
2016-02-29 16:00
leetcode笔记：Majority Element II
一.题目描述Givenanintegerarrayofsizen,findallelementsthatappearmorethan⌊n/3⌋times.The
algorithms
houldruninlineartimeandinO
Herbert_Zero
·
2016-02-28 20:55
数据结构与算法
leetcode笔记
leetcode笔记：Majority Element II
一.题目描述Givenanintegerarrayofsizen,findallelementsthatappearmorethan⌊n/3⌋times.The
algorithms
houldruninlineartimeandinO
liyuefeilong
·
2016-02-28 20:00
LeetCode
C++
算法
vote
Moore
Leet Code OJ 136. Single Number [Difficulty: Medium]
题目：Givenanarrayofintegers,everyelementappearstwiceexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
Lnho2015
·
2016-02-26 11:00
算法
LeetCode 41. First Missing Positive
Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given[1,2,0]return3,and[3,4,-1,1]return2.Your
algorithms
houldruninO
暖日初升
·
2016-02-26 07:00
一个数据结构与算法可视化的网站
http://www.cs.usfca.edu/~galles/visualization/
Algorithms
.html
github_33890270
·
2016-02-23 14:00
数据结构
可视化
Majority Element II
Givenanintegerarrayofsizen,findallelementsthatappearmorethan⌊n/3⌋times.The
algorithms
houldruninlineartimeandinO
KickCode
·
2016-02-23 09:01
Moore
Voting算法
leetcode刷题系列C++-single number II
Givenanarrayofintegers,everyelementappears three timesexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
u013676711
·
2016-02-22 17:00
leetcode刷题系列C++-single number I
Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
u013676711
·
2016-02-22 16:00
spark_3：spark的基础
RDD可被切分由一个函数计算每一个分片对其他的RDD依赖可选：key-value的rdd是根据hash来分区的，类似于partitioner接口RDD计算模式Iterative
Algorithms
RelationalQueriesMapRdecueStreamingRDD
mijian1207mijian
·
2016-02-21 16:00
136.Single Number
Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
torrescx
·
2016-02-20 20:00
LeetCode 268. Missing Number
distinctnumberstakenfrom 0,1,2,...,n,findtheonethatismissingfromthearray.Forexample,Given nums = [0,1,3] return 2.Note:Your
algorithms
houldruninlinearruntimecomplexity.Couldyou
Appletable
·
2016-02-20 16:00
Stanford公开课Machine learning第一课
Machinelearning,abranchofartificialintelligence,isascientificdisciplineconcernedwiththedesignanddevelopmentof
algorithms
thattakeasinputempiricaldata
Aga.J
·
2016-02-20 15:48
C/C++ 函数所在的头文件（二）
头文件stuffheader说明mallocexitstrlen也给出了该函数的实现自然无需在std的命名空间中typeid但不在std标准命名空间中C++头文件stuffheader说明min/max
algorithms
tdcstdlib
lanchunhui
·
2016-02-20 08:00
leetcode：Swap Nodes in Pairs
swapeverytwoadjacent（相邻的）nodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Your
algorithms
houlduseonlyconstantspace.Youmay
carsonzhu
·
2016-02-19 15:00
leetcode笔记：Missing Number
Givenanarraycontainingndistinctnumberstakenfrom0,1,2,...,n,findtheonethatismissingfromthearray.Forexample,Givennums=[0,1,3]return2.Note:Your
algorithms
houldruninlinearruntimecomplexity.Couldyouim
liyuefeilong
·
2016-02-19 14:00
LeetCode
C++
算法
异或
XOR
LeetCode -- Single Number II
Question:Givenanarrayofintegers,everyelementappears three timesexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
码代码的小女孩
·
2016-02-19 11:00
标准模板库（Standard Template Library，STL）学习
编写代码的方法、STL代码的编译和调试、命名空间（namespace）、STL中的ANSI/ISO字符串、各种不同类型的容器（container）、模板（template）、游标（Iterator）、算法（
Algorithms
dubuyunduan85
·
2016-02-19 10:02
c++
LeetCode题解-----First Missing Positive
Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your
algorithms
houldrunin
姚灯灯!
·
2016-02-18 22:00
LeetCode题解-----First Missing Positive
Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your
algorithms
houldrunin
姚灯灯!
·
2016-02-18 22:00
LeetCode 137 Single Number II（只出现一次的数字 II）（*）
原文Givenanarrayofintegers,everyelementappearsthreetimesexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomp
nomasp
·
2016-02-18 19:12
LeetCode
LeetCode 137 Single Number II（只出现一次的数字 II）（*）
Note: Your
algorithms
houldhavealinearrunti
NoMasp
·
2016-02-18 19:00
LeetCode
位运算
number
single
137
LeetCode 137 Single Number II（只出现一次的数字 II）（*）
Note: Your
algorithms
houldhavealinearrunti
NoMasp
·
2016-02-18 19:00
LeetCode
位运算
number
single
137
mysql5.6子查询的优化
subquery-optimization.html Semi-joininMySQL5.6 MySQL5.6.5DevelopmentMilestoneReleasehasawholenewsetof
algorithms
forprocessingsubqueries.Itisbasedontransformingas
yuyue2014
·
2016-02-18 16:00
LeetCode 136 Single Number（只出现一次的数字）
Note: Your
algorithms
houldhavealinearrun
NoMasp
·
2016-02-18 15:00
LeetCode
vector
single
Numbers
136
LeetCode 136 Single Number（只出现一次的数字）
Note: Your
algorithms
houldhavealinearrun
NoMasp
·
2016-02-18 15:00
LeetCode
vector
single
Numbers
136
LeetCode 136. Single Number
Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
u012348655
·
2016-02-17 22:00
LeetCode
LeetCode
number
single
single
136.
136.
leetcode刷题系列C++-Longest Consecutive Sequence
Forexample,Given [100,4,200,1,3,2],Thelongestconsecutiveelementssequenceis [1,2,3,4].Returnitslength: 4.Your
algorithms
houldruninO
u013676711
·
2016-02-17 14:00
HackerRank "Training the army" - Max Flow
FirstproblemtolearnMaxFlow.Ford-Fulkersonisagroupof
algorithms
-Dinicisoneofit.Itisaniterativeprocess:weuseBFStocheckaugament-ability
Tonix
·
2016-02-17 12:00
UVa 1025 A Spy in the Metro dp : DAG、最短路
1025ASpyintheMetroTimeLimit: 3000MS MemoryLimit: Unknown 64bitIOFormat: %lld&%lluSubmit StatusSecretagentMariawassentto
Algorithms
Citytocarryoutanespeciallydangerousmission.Afterseveralthrillingeve
ProLightsfxjh
·
2016-02-16 18:00
dp
ACM
最短路
uva
DAG
快速近似最近邻搜索库 FLANN - Fast Library for Approximate Nearest Neighbors
FLANNisalibraryforperformingfastapproximatenearestneighborsearchesinhighdimensionalspaces.Itcontainsacollectionof
algorithms
wefoundtoworkbestfornearestneighborsearchandasystemforautomatical
garfielder007
·
2016-02-16 14:56
计算机视觉CV
LeetCode 136.137. 260.Single Number ⅠII III
SingleNumberⅠ:Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
Appletable
·
2016-02-15 23:00
M家面试
Given4teamsand3gamedays,createan
algorithms
uchthateachteamplaysanotherteameverygamedayandbytheendofthe3gamedayseachteamshouldhaveplayedonegamewitheveryotherteam.Alg1
bxuAir
·
2016-02-15 12:06
usaco 1.3.1 Greedy Algorithm
textbookNotesThebasicideabehindgreedy
algorithms
istobuildlargesolutionsupfromsmallerones.Unlikeotherapproaches
qq_32209643
·
2016-02-15 11:00
算法
Single Number
Givenanarrayofintegers,everyelementappearstwiceexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
KickCode
·
2016-02-14 12:07
位运算
Single Number II
Givenanarrayofintegers,everyelementappearsthreetimesexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
KickCode
·
2016-02-14 12:23
位运算
HDU 5627 Clarke and MST &意义下最大生成树 贪心
5627DescriptionClarkeisapatientwithmultiplepersonalitydisorder.Onedayheturnedintoalearnerofgraphtheory.Helearnedsome
algorithms
ofminimumspanni
qscqesze
·
2016-02-14 01:00
hdu 5627 Clarke and MST（最大 生成树）
Helearnedsome
algorithms
ofminimumspanningtree.Thenhehadagoodidea,hewantedtofindthemaximumspann
UniqueColor
·
2016-02-13 21:00
机器学习之Online Passive-Aggressive
Algorithms
(回归)
上一篇博客http://blog.csdn.net/sihuahaisifeihua/article/details/50651024主要说了PA算法在二类分类的应用，这篇博客说一说其在回归问题上的应用(我觉得这篇文章还是值得研究的)，代码的实现也是很容易的，但是这里我就不在给出代码，仅仅把论文的公式推导一下，关于代码实现真心很简单。。。此时的误差函数(e-insensitivehingelose
sihuahaisifeihua
·
2016-02-13 20:00
机器学习
笔记概要
1:使用书籍
Algorithms
(FourthEdition) 中文译名“算法” 作者RobertSedgewick,KevinWayne 点击打开链接2:描述语言：java
qq_29169749
·
2016-02-13 16:00
PrincetonUniversity-Coursera 算法:算法简介
Intermediate-levelsurveycourse.Programmingandproblesolving,withapplicationsAlgorithm:methodforsolvingaproblemDatastruvture:methodtostroeinformationWhystudy
algorithms
utimes
·
2016-02-13 11:00
Single Number II
阅读更多Givenanarrayofintegers,everyelementappearsthreetimesexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
KickCode
·
2016-02-13 01:00
位运算
Single Number II
阅读更多Givenanarrayofintegers,everyelementappearsthreetimesexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
KickCode
·
2016-02-13 01:00
位运算
Single Number
阅读更多Givenanarrayofintegers,everyelementappearstwiceexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
KickCode
·
2016-02-13 01:00
位运算
Single Number
阅读更多Givenanarrayofintegers,everyelementappearstwiceexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
KickCode
·
2016-02-13 01:00
位运算
我的算法学习之路 （转载)
如果你使用的是手机或平板设备，那么请点击下面的链接以获得更好的阅读效果：http://zh.lucida.me/blog/on-learning-
algorithms
/原文作者：Lucida这篇文章讲了什么
fengsigaoju
·
2016-02-11 20:00
机器学习之Online Passive-Aggressive
Algorithms
(二类分类)
这篇博客打算说一说，Trident-ml(基于Storm的机器学习算法包)里面的一个分类算法，不知道OnlinePassive-Aggressive
Algorithms
(论文连接：http://jmlr.csail.mit.edu
sihuahaisifeihua
·
2016-02-11 10:00
算法
storm
机器学习
在线学习
Trident-ml
Longest Consecutive Sequence
findthelengthofthelongestconsecutiveelementssequence.Forexample,Given[100,4,200,1,3,2],Thelongestconsecutiveelementssequenceis[1,2,3,4].Returnitslength:4.Your
algorithms
h
KickCode
·
2016-02-11 03:00
并查集
连续序列
LeetCode题解：Longest Consecutive Sequence
findthelengthofthelongestconsecutiveelementssequence.Forexample,Given[100,4,200,1,3,2],Thelongestconsecutiveelementssequenceis[1,2,3,4].Returnitslength:4.Your
algorithms
h
u012403246
·
2016-02-09 13:00
LeetCode
First Missing Positive
Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your
algorithms
houldrunin
walkwalkwalk
·
2016-02-07 15:00
上一页
88
89
90
91
92
93
94
95
下一页
按字母分类：
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
其他