Algorithms:

Leetcode：First Missing Positive

Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Youralgorithmshouldrunin
nanjunxiao·2013-10-23 16:00

【LeetCode OJ】Single Number II

Givenanarrayofintegers,everyelementappears three timesexceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
xiaozhuaixifu·2013-10-21 13:00

[google面试CTCI] 1-7.将矩阵中特定行、列置0

【字符串与数组】Q：WriteanalgorithmsuchthatifanelementinanMxNmatrixis0,itsentirerowandcolumnissetto0.题目：写一个算法，
·2013-10-19 22:00

策略模式

strategy-pattern.htmlMotivationTherearecommonsituationswhenclassesdifferonlyintheirbehavior.Forthiscasesisagoodideatoisolatethealgorithmsinseparateclassesinordertohavethea
xiaobin_HLJ80·2013-10-18 22:00

细数二十世纪最伟大的10大算法

译者：July   二零一一年一月十日------------------------------------参考文献：TheBestofthe20thCentury:EditorsNameTop10Algorithms
·2013-10-18 15:00

开源工具：OpenPR

OpenPR,standsforOpenPatternRecognitionprojectandisintendedtobeanopensourceplatformforsharingalgorithmsofimageprocessing
u012211748·2013-10-18 15:00

求圆圈中剩下的最后一个数字

publicclassAlgorithms01{/*** */publicstaticvoidmain(String[]args){//TODOAuto-g
wisgood·2013-10-17 22:00

Exact Algorithms for NP-Complete Problems

1. TheVertexCoverProblem  -- Input:AnundirectedgraphG=(V,E).  -- Goal:Computeaminimum-cardinalityvertexcover--asubsetSsubsetofVthatcontainsatleastoneendpointofeachedgeofG.  -- Theminimumsizeofavertexc
leonzhx·2013-10-15 19:00

c语言排序算法 动画效果展示

c语言排序算法可视化展示地址---手动查看版本：http://www.sorting-algorithms.com/c语言排序算法可视化展示地址---视频制作版本：http://v.youku.com/
huihuang1515·2013-10-13 20:00

计算机视觉知识结构图

引言本节内容主要来源于ComputerVision:AlgorithmsandApplications一书。
utimes·2013-10-13 01:00

计算机视觉算法源码

vision.eecs.ucf.edu/source.htmlSourceCode[BackgroundModeling][ShapefromShading][FundamentalMatrix][Mean-ShiftAlgorithms
chlele0105·2013-10-11 19:00

lsm-tree

http://blog.sina.com.cn/s/blog_693f08470101njc7.htmlhttp://blog.xiuwz.com/2012/04/09/large-web-algorithms
sunmenggmail·2013-10-10 10:00

[LeetCode(Q41)] First Missing Positive (乱序数组中寻找第一个未出现的正整数)

Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given[1,2,0] return3,and[3,4,-1,1] return2.Youralgorithmshouldrunin
suwei19870312·2013-10-09 16:00

【LeetCode】Swap Nodes in Pairs

swapeverytwoadjacentnodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Youralgorithmshoulduseonlyconstantspace.Youmay
xiaozhuaixifu·2013-10-07 20:00

levelset 解释

HerveLombaertResearch Projects Algorithms School Presentations ScheduleLevelsetmethod:ExplanationHerethebasicsofthelevelsetmethodisexplained
·2013-10-06 17:00

[LeetCode] Single Number II

SingleNumberII Givenanarrayofintegers,everyelementappears three timesexceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
a83610312·2013-10-06 16:00

Binary Search Tree(BST)二叉搜索树的实现-java语言

在《COMPUTERALGORITHMSIntroductiontoDesignandAnalysis》一书中对ＢＳＴ的定义如下：Abinarytreeinwh
u011321908·2013-10-06 16:00

Leetcode: First Missing Positive

Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Youralgorithmshouldrunin
doc_sgl·2013-10-05 22:00

leetcode -- Single Number II

3351379.htmlGivenanarrayofintegers,everyelementappearsthreetimesexceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementit
wuxinliulei·2013-10-05 14:00

推荐系统-基于用户的最近邻协同过滤算法（MovieLens数据集）

基于用户的最近邻算法（User-BasedNeighborAlgorithms）,是一种非概率性的协同过滤算法，也是推荐系统中最最古老，最著名的算法。
wxx634897019·2013-10-04 18:00

Leetcode习题： SingleNumber II

1255MySubmissionsGivenanarrayofintegers,everyelementappears three timesexceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementit
bigapplestar·2013-10-04 11:00

[LeetCode] Single Number II

Givenanarrayofintegers,everyelementappears three timesexceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
jellyYin·2013-10-04 10:00

Single Number II

Givenanarrayofintegers,everyelementappearsthreetimesexceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
violet_program·2013-10-04 01:00

【LeetCode】Single Number

description:Givenanarrayofintegers,everyelementappears twice exceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
xiaozhuaixifu·2013-10-03 20:00

Leetcode: Single Number II

Givenanarrayofintegers,everyelementappears three timesexceptforone.Findthatsingleone.Note:Youralgorithmshouldhavealinearruntimecomplexity.Couldyouimplementitwithoutusingextramemory
doc_sgl·2013-10-03 20:00

Leetcode: Swap Nodes in Pairs

swapeverytwoadjacentnodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Youralgorithmshoulduseonlyconstantspace.Youmay
doc_sgl·2013-10-02 22:00

LeetCode Question Difficulty Distribution : Sheet1

20wSNYfuxdGxQWVFsOGdVVWxQRlNUVXZTdEpOeEE&output=htmlLeetCodeQuestionDifficultyDistribution:Sheet1       IDQuestionDiffFreqDataStructureAlgorithms
xiaozhuaixifu·2013-10-01 09:00

红黑树学习笔记

参考了算法导论以及Algorithms,4thEditionbyRobertSedgewickandKevinWayne带关键字的结点为树的内结点。叶子为树的外结点。
zhanglei0107·2013-09-30 19:00

ascii animation

www.ludd.luth.se/~vk/pics/ascii/junkyard/techstuff/tutorials/Joan_Stark.html#ASCII http://www.jave.de/image2ascii/algorithms.htmlhttp
bytebear·2013-09-29 00:00

[LeetCode]024. Swap Nodes in Pairs

swapeverytwoadjacentnodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Youralgorithmshoulduseonlyconstantspace.Youmay
myself9711·2013-09-25 06:00

排序算法总结

http://www.sorting-algorithms.com七大算法总结（只是跑过这一个例子，如有不足，欢迎指正）：代码如下： publicclassSort{ publicstaticvoidmain
闫强同学·2013-09-24 16:00

一步一图一代码，一定要让你真正彻底明白红黑树

   二零一一年一月九日-----------------------------本文参考：I、 TheArtofComputerProgrammingVolumeIII、IntroductiontoAlgorithms
chenhuajie123·2013-09-23 21:00

Stanford Algorithms: Design and Analysis, Part 2[week 3]

ProblemSet-3dp[n][c1][c2]=max{dp[n-1][c1-w_n][c2]+v_n,dp[n-1][c1][c2-w_n]+v_n,dp[n-1][c1][c2]}dp[n][c1][c2]表示两个背包现在分别有c1,c2的容量，取前n个物体的最大值根据第n个物体由1，由2或者两人都不取来转移ProgrammingAssignment-3Question1Inthispro
jj12345jj198999·2013-09-22 08:00

The Most Important Algorithms

AfteralongdiscussionwithsomeofmyRISCcolleaguesabout   whatthe5mostimportantalgorithmsontheworldare,   
Scape1989·2013-09-21 16:00

Stanford Algorithms学习：Clustering 2

这是紧接上面的一道题，比较有趣Question2Inthisquestionyourtaskisagaintoruntheclusteringalgorithmfromlecture,butonaMUCHbiggergraph.Sobig,infact,thatthedistances(i.e.,edgecosts)areonlydefined implicitly,ratherthanbeing
likecool21·2013-09-21 08:00

排序算法

终于狠下心来要好好学习下算法了，买了经典名作：算法导论，另外在网易公开课上收看MIT的IntorductiontoAlgorithms，为了正握的更透彻，也为了方便以后复习，把掌握的内容记录下来。
·2013-09-20 16:00

带权最短路 Dijkstra, SPFA, Bellman-Ford, ASP, Floyd-Warshall 算法分析

带权最短路Dijkstra,SPFA,Bellman-Ford,ASP,Floyd-Warshall算法分析2013-08-04AlgorithmsBellman-Ford, Dijkstra, Floyd
pi9nc·2013-09-20 15:00

二分图的最大匹配、完美匹配和匈牙利算法

二分图的最大匹配、完美匹配和匈牙利算法2013-08-01Algorithms二分图匹配, 图论, 算法这篇文章讲无权二分图（unweightedbipartitegraph）的最大匹配（maximummatching
pi9nc·2013-09-20 15:00

First Missing Positive （寻找第一个丢失的正数）【leetcode】

Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Youralgorithmshouldrunin
zhang9801050·2013-09-18 16:00

Stanford Algorithms学习：Clustering

第二周的第一个编程作业，是利用贪婪算法来实现一个clustering的问题，和ML里学的unsupervisedlearning差不多。Question1Inthisprogrammingproblemandthenextyou'llcodeuptheclusteringalgorithmfromlectureforcomputingamax-spacing k-clustering.Downlo
likecool21·2013-09-18 14:00

Stanford Algorithms: Design and Analysis, Part 2[week 2]

ProblemSet-2ProgrammingAssignment-2Question1Inthisprogrammingproblemandthenextyou'llcodeuptheclusteringalgorithmfromlectureforcomputingamax-spacing k-clustering.Downloadthetextfile here.Thisfiledescri
jj12345jj198999·2013-09-15 15:00

LeetCode | First Missing Positive

Givenanunsortedintegerarray,findthefirstmissingpositiveinteger.Forexample,Given [1,2,0] return 3,and [3,4,-1,1] return 2.Youralgorithmshouldrunin
lanxu_yy·2013-09-15 00:00

LeetCode | Swap Nodes in Pairs

swapeverytwoadjacentnodesandreturnitshead.Forexample,Given 1->2->3->4,youshouldreturnthelistas 2->1->4->3.Youralgorithmshoulduseonlyconstantspace.Youmay
lanxu_yy·2013-09-14 21:00

Leetcode Problem difficulty level and frequency table

LeetcodeQuestionsIdQuestionDifficultyFreqencyDataStructuresAlgorithms1TwoSum25arraysetsorttwopointers2AddTwoNumbers34linkedlisttwopointersmath3LongestSubstringWithoutRepeatingCharacters32stringhashtab
doc_sgl·2013-09-13 23:00

LeetCode Question Difficulty Distribution : Sheet1

LeetCodeQuestionDifficultyDistribution:Sheet1       IDQuestionDiffFreqDataStructureAlgorithms                
qianlong4526888·2013-09-11 09:00

Prim's MST Algorithm

BlazinglyFastGreedyAlgorithms:   -Prim'sAlgorithm   -Kruskal'salgorithm   O(mlogn) misthe#ofedgesandnisthe
leonzhx·2013-09-10 15:00

Introduction to Greedy Algorithm

 Greedy Algorithms : Iteratively make "myopic" decisions, hope everything works
leonzhx·2013-09-10 12:00

Introduction to Deep Learning Algorithms

原文地址：http://www.iro.umontreal.ca/~pift6266/H10/notes/deepintro.htmlSeethefollowingarticleforarecentsurveyofdeeplearning:YoshuaBengio,LearningDeepArchitecturesforAI,FoundationsandTrendsinMachineLearnin
xceman1997·2013-09-08 17:00

【数据结构与算法】浅谈尾递归

而我在《算法精解：C语言描述》（MasteringAlgorithmswithC）中也看到书中提到编译器会对尾
mmc_maodun·2013-09-07 23:00

有无序的实数列 V[N]，要求求里面大小相邻的实数的差的最大值，关键是要求线性空 间和线性时间

转自:http://marinemath.wordpress.com/tag/algorithms/昨天逛csdn看到一道很有意思的问题：有无序的实数列V[N]，要求求里面大小相邻的实数的差的最大值M，
hanchengxi·2013-09-07 09:00
上一页 118 119 120 121 122 123 124 125 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他