//leetcode中還有花樣鏈表題，這里幾個(gè)例子，冰山一角 求單鏈表中結(jié)點(diǎn)的個(gè)數(shù)----時(shí)間復(fù)雜度O（n）這是最最基本的了，應(yīng)該能夠迅速寫出正...
投稿
收錄了9篇文章 · 9人關(guān)注
-
算法筆記：鏈表
-
algorithms-ch8: P, NP, NP-Hard and NP-Complete
概念 Search Problem(eg:SAT)search problem can be verified in polynomial ti...
-
關(guān)于搜索引擎的幾種算法
查一些參考資料，摘錄一些感覺以后會(huì)用到的部分 PageRank 該算法基于“從許多優(yōu)質(zhì)的網(wǎng)頁鏈接過來的網(wǎng)頁，必定還是優(yōu)質(zhì)網(wǎng)頁”的回歸關(guān)系，認(rèn)為從...
-
推薦算法相關(guān)
(侵刪) 推薦引擎的分類 根據(jù)不同的數(shù)據(jù)源發(fā)現(xiàn)數(shù)據(jù)相關(guān)性的方法可以分為以下幾種： 根據(jù)系統(tǒng)用戶的基本信息發(fā)現(xiàn)用戶的相關(guān)程度，這種被稱為基于人口統(tǒng)...
-
algorithms-ch0
final 周一邊復(fù)習(xí)一邊過一遍這本書--algorithms，中文名叫--算法概論，參考教材是introduction to algorith...
-
algorithms-ch1-Algorithms with numbers
1.1Basic arithmetic 1.1.1addition -Given two binary numbers x and y, how...
-
algorithms-ch2-divide and conquer（分治法）
The divide-and-conquer strategy solves a problem by: Breaking it into su...
-
algorithms-ch3-Decompositions of graphs3.1 Graphs Represent a graph by Adjacency matrix -- sparse graphn = |V |...
-
algorithms-ch4-paths in graphs4.1 Distane The distance between two nodes is the length of the shortest...
{var%20f='http://v.t.sina.com.cn/share/share.php?appkey=1881139527',u=z||d.location,p=['&url=',e(u),'&title=',e(t||d.title),'&source=',e(r),'&sourceUrl=',e(l),'&content=',c||'gb2312','&pic=',e(p||'')].join('');function%20a(){if(!window.open([f,p].join(''),'mb',['toolbar=0,status=0,resizable=1,width=440,height=430,left=',(s.width-440)/2,',top=',(s.height-430)/2].join('')))u.href=[f,p].join('');};if(/Firefox/.test(navigator.userAgent))setTimeout(a,0);else%20a();})(screen,document,encodeURIComponent,'','','https://upload.jianshu.io/collections/images/262111/510VmClAncL._SY344_BO1_204_203_200_.jpg', '推薦專題《Algorithms/算法之美》（ 分享自 @簡書 ）','http://www.itdecent.cn/c/6fff2eee2c65?utm_campaign=maleskine&utm_content=collection&utm_medium=reader_share&utm_source=weibo','頁面編碼gb2312|utf-8默認(rèn)gb2312'));){kind=link}