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:
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
数据结构与算法速查表
http://bigocheatsheet.com/ http://cooervo.github.io/
Algorithms
-DataStructures-BigONotation/index.htmlhttp
hotea
·
2016-02-07 11:00
Algorithm
Data
stracture
#137 Single Number II
Givenanarrayofintegers,everyelementappears three timesexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
梦幻之海
·
2016-02-05 22:00
LeetCode 137. Single Number II
SingleNumberII Givenanarrayofintegers,everyelementappears three timesexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusinge
leonard1853
·
2016-02-04 21:13
LeetCode
算法
面试
LeetCode 136. Single Number
SingleNumber Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.C
leonard1853
·
2016-02-04 21:12
LeetCode
算法
面试
2016大数据发展7大趋势
1.算法（
Algorithms
）的崛起大数据已过时，算法正当道。数据已经成为一种商品，每个组织都能够收集和存储大量的数据。分析大数据也不再那么引人注目了。
数据分析师
·
2016-02-03 10:00
Awesome
Algorithms
Awesome
Algorithms
Acuratedlistofawesomeplacestolearnand/orpractice
algorithms
.Inspiredbyawesome-awesomenessandalltheotherawesomeAwesomelibraries.Ifyouwanttocontribute
隃墨
·
2016-02-02 21:00
Awesome
Algorithms
Awesome
Algorithms
Acuratedlistofawesomeplacestolearnand/orpractice
algorithms
.Inspiredbyawesome-awesomenessandalltheotherawesomeAwesomelibraries.Ifyouwanttocontribute
隃墨
·
2016-02-02 21:00
LeetCode24. Swap Nodes in Pairs简单到一次性通过
swapeverytwoadjacentnodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Your
algorithms
houlduseonlyconstantspace.Youmay
booirror
·
2016-02-02 21:00
LeetCode
链表
面试题
137. Single Number II
Givenanarrayofintegers,everyelementappearsthreetimesexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
偏爱纯白色
·
2016-01-31 21:00
leetcode 136. Single Number
题目原文Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
guodongxiaren
·
2016-01-31 16:00
LeetCode
sort
STL
accmulate
136
Missing Number
distinctnumberstakenfrom 0,1,2,...,n,findtheonethatismissingfromthearray.Forexample,Given nums = [0,1,3] return 2.Note:Your
algorithms
houldruninlinearruntimecomplexity.Couldyou
brucehb
·
2016-01-30 22:00
Analysis of
algorithms
: observation
例子：3-Sum给定N个整数，这里面有多少个三元组，使其三个整数相加为0,如上面的例子为有4个三元组。这个问题是许多问题如计算机几何，图形学等的基础.用简单粗暴的方式来解决3-Sum问题通过三个for循环来执行那么怎么计算它运行的时间呢？Java有一个内嵌的函数来计算运行时间：Stopwatch() 我们通过对不同的inputsize来运行获得运行时间，如上图所示，那么根据这些已得出来
李燕
·
2016-01-30 21:00
Analysis of
algorithms
: introduction
一系列的人物角色Programmer,client,theoretician和blocking学生可能会承担里面的一个或者多个角色Runningtime提出runningtime这个概念的可能要追溯到很远的时候，那时通过analyticengine来计算howmanytimesturnlthecrank(手柄)为什么要分析算法一些高效算法的例子 快速傅里叶变换：NlogN而不是N2,快速傅里叶变
李燕
·
2016-01-30 16:00
First Missing Positive -- LeetCode
Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your
algorithms
houldrunin
fenshen371
·
2016-01-30 14:00
Instant Complexity - POJ1472
InstantComplexityTimeLimit:1000MSMemoryLimit:10000KDescriptionAnalyzingtherun-timecomplexityof
algorithms
isanimportanttoolfordesigningefficientprogramsthatsolveaproblem.Analgorithmthatrunsinlineartimei
huayunhualuo
·
2016-01-27 17:00
Spark入门实战系列--1.Spark及其生态圈简介
1、简介1.1 Spark简介Spark是加州大学伯克利分校AMP实验室（
Algorithms
,Machines,andPeopleLab）开发通用内存并行计算框架。
莫问viva
·
2016-01-27 09:00
spark
core
Python遗传算法框架DEAP-Operators and
Algorithms
Beforestartingwithcomplex
algorithms
,wewillseesomebasicsofDEAP.First,wewillstartbycreatingsimpleindividuals
MichaelXoX
·
2016-01-27 00:00
数据挖掘
机器学习
python
95. Single Number II
Givenanarrayofintegers,everyelementappears three timesexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
u010339647
·
2016-01-26 22:00
Single Number
*Note: *Your
algorithms
hou
wzyxidian
·
2016-01-25 20:00
Majority Element II
MajorityElementII，题目描述是这样的：Givenanintegerarrayofsizen,findallelementsthatappearmorethan⌊n/3⌋times.The
algorithms
houldruninlineartimeandinO
薛聚坡
·
2016-01-25 20:00
leetcode 136. Single Number
原题：Givenanarrayofintegers,everyelementappearstwiceexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
·
2016-01-25 16:00
LeetCode
24. Swap Nodes in Pairs
swapeverytwoadjacentnodesandreturnitshead.Forexample,Given1->2->3->4,youshouldreturnthelistas2->1->4->3.Your
algorithms
houlduseonlyconstantspace.Youmaynotmodifythevaluesintheli
VicHawk
·
2016-01-25 16:00
【LeetCode OJ 41】First Missing Positive
Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Your
algorithms
houl
xujian_2014
·
2016-01-25 09:00
java
LeetCode
设计模式-行为型模式-策略模式
这里我贴上英文对含义的介绍，TheStrategyPatterndefinesafamilyof
algorithms
,encapsulateseachone,andmakestheminterchangeable.Strategyletsthealgorithmvaryindependentlyfromclientsthatuseit
种花生的读书人
·
2016-01-23 23:00
[LeetCode24]Swap Nodes in Pairs
swapeverytwoadjacentnodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Your
algorithms
houlduseonlyconstantspace.Youmay
薛定谔的喵
·
2016-01-22 19:00
STL入门之处理相反数
STL的基本组件容器（container）迭代器（iterator）函数对象（functionobject）算法（
algorithms
）在这里使用了 transform 函数实现了相反数的处理其中：transform
qq_33638791
·
2016-01-21 20:00
Missing Number
Givenanarraycontainingndistinctnumberstakenfrom0,1,2,...,n,findtheonethatismissingfromthearray.Forexample,Givennums=[0,1,3]return2.Note:Your
algorithms
houldruninlinearruntimecomplexity.Couldyouimplemen
maoyeqiu
·
2016-01-21 20:00
算法
【LeetCode OJ 136】Single Number
single-number/题目：Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimpleme
xujian_2014
·
2016-01-21 16:00
java
LeetCode
算法复杂度分析
转载自http://www.cnblogs.com/gaochundong/p/complexity_of_
algorithms
.html 为什么要进行算法分析？
mcj8089
·
2016-01-20 15:00
算法
时间复杂度
空间复杂度
算法复杂度
MIT Introduction to
Algorithms
学习笔记(十)
Lecture9:HashingII:TableDoubling,Karp-Rabin 散列表应该有多大? 理想状态:根据需要改变大小.(重散列)Rehashing 增长:散列表长度成倍增长是个好选择. 删除:字符串匹配(StringMatching)SimpleAlgorithm:Karp-RabinAlgorithm: python代码：def karp_rabin(T, P): n
hyaicc
·
2016-01-19 12:00
python
hash
算法导论
巧用位操作符之——^异或运算符
Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementi
pepping798
·
2016-01-19 11:00
异或
位运算符
[Leetcode 136] Single Number
原题：Givenanarrayofintegers,everyelementappearstwiceexceptforone.Findthatsingleone.Note:Your
algorithms
houldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
wizard_wsq
·
2016-01-17 11:00
LeetCode
算法
异或
[置顶] for_each算法和transform算法区别
http://文章：for_each()算法：点击打开链接transform()算法：点击打开链接 首先，for_each()算法和transform()算法都是属于变动性算法（modifying
algorithms
xiao3404
·
2016-01-16 22:00
C++
区别
STL
transform
for_each
Function Set in OPEN CASCADE
[email protected]
algorithms
libraryprovidesaC++implementationofthemostfrequentlyusedmathematical
algorithms
.Theseinclude
eryar
·
2016-01-16 13:00
【Java】八个常用的排序算法：插入排序、冒泡排序、选择排序、希尔排序 、快速排序、归并排序、堆排序和LST基数排序
希尔排序、快速排序、归并排序、堆排序和LST基数排序,需要的朋友可以参考下本文实现了八个常用的排序算法：插入排序、冒泡排序、选择排序、希尔排序、快速排序、归并排序、堆排序和LST基数排序首先是Eight
Algorithms
.java
不能吃的坚果
·
2016-01-16 13:30
算法
OPEN CASCADE Multiple Variable Function
comAbstract.MultiplevariablefunctionwithgradientandHessianmatrixisveryveryimportinOPENCASCADEoptimization
algorithms
.Inordertounderstandtheseoptimizationalg
eryar
·
2016-01-16 13:00
Algorithms
Ref:LBS新应用：地理围栏技术Ref:地理围栏算法解析Ref:高德LBS开放平台Ref:从B树、B+树、B*树谈到R树Ref:结构之法算法之道Ref:The-Art-Of-Programming-By-JulyRef:《编程之法：面试和算法心得》
Nick.Chung
·
2016-01-15 11:00
Function Set in OPEN CASCADE
[email protected]
algorithms
libraryprovidesaC++implementationofthemostfrequentlyusedmathematical
algorithms
.Theseinclude
opencascade
·
2016-01-13 19:00
Function Set in OPEN CASCADE
[email protected]
algorithms
libraryprovidesaC++implementationofthemostfrequentlyusedmathematical
algorithms
.Theseinclude
eryar
·
2016-01-13 19:00
值得mark的网站~
http://www.typing-lessons.org/题解汇总网站：http://www.acmsearch.com/Leetcode：https://leetcode.com/problemset/
algorithms
如也
·
2016-01-12 16:00
值得mark的网站~
http://www.typing-lessons.org/题解汇总网站：http://www.acmsearch.com/Leetcode：https://leetcode.com/problemset/
algorithms
如也
·
2016-01-12 16:00
MIT Introduction to
Algorithms
学习笔记(九)
Lecture8:HashingI字典一种抽象数据类型(AbstractDataType ，ADT)，维护一组元素，每个元素都与一个关键字(KEY)相关，并有以下操作：实现直接寻址表（DirectAccessTable）：用KEY为数据下标保存元素。问题：key必须是非负整数。key的范围不能太大。 解决方法：散列表(hashing): 怎么处理碰撞(collision)?连接法：把散列到同一槽
hyaicc
·
2016-01-12 15:00
python
hash
算法导论
无向图相关算法基础
从这篇文章开始介绍图相关的算法，这也是
Algorithms
在线课程第二部分的第一次课程笔记。图的应用很广泛，也有很多非常有用的算法，当然也有很多待解决的问题，根据性质，图可以分为无向图和有向图。
lpx15312
·
2016-01-11 13:00
Swap Nodes in Pairs
swapeverytwoadjacentnodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Your
algorithms
houlduseonlyconstantspace.Youmay
walkwalkwalk
·
2016-01-10 22:00
Swap Nodes in Pairs
swapeverytwoadjacentnodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Your
algorithms
houlduseonlyconstantspace.Youmay
walkwalkwalk
·
2016-01-10 22:00
Notes of RDD
MotivationSincenowwiththepreparationonJavaI/O,somefundamentalconcurrencyandparallelcomputingconcepts,somefundamentalconceptsofdistributed
algorithms
andsystems
zhoujiagen
·
2016-01-10 18:00
24. Swap Nodes in Pairs leetcode Python 2016 new Season
swapeverytwoadjacentnodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Your
algorithms
houlduseonlyconstantspace.Youmay
hyperbolechi
·
2016-01-10 12:00
上一页
90
91
92
93
94
95
96
97
下一页
按字母分类：
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
其他