Asian_Road - 簡(jiǎn)書(shū)

IP屬地：江蘇

鏈接分析算法總結(jié)
兩個(gè)模型隨機(jī)游走模型：網(wǎng)頁(yè)節(jié)點(diǎn)通過(guò)鏈接進(jìn)行跳轉(zhuǎn)沼侣，對(duì)應(yīng)跳轉(zhuǎn)的概率子集傳播模型：網(wǎng)頁(yè)劃分子集疆导，給予特殊子集內(nèi)網(wǎng)頁(yè)初始權(quán)值综膀，然后根據(jù)特殊子集內(nèi)網(wǎng)頁(yè)...

1822 0 0
面試時(shí)常問(wèn)的10個(gè)數(shù)據(jù)庫(kù)問(wèn)題
inner join 和 outer join 的區(qū)別? 假設(shè)你要join兩個(gè)沒(méi)有重復(fù)列的表澳迫，這是最常見(jiàn)的情況：inner join A 和 ...

1649 0 0

部分背包問(wèn)題
貪心算法 Python 問(wèn)題描述：給定n個(gè)物品，物品價(jià)值分別為$P_1$剧劝，$P_2$橄登，$...$，$P_n$担平，物品重量分別為$W_1$示绊，$W_2...

1652 0 0
0-1 背包問(wèn)題
動(dòng)態(tài)規(guī)劃遞歸 Python 問(wèn)題描述：在M件物品取出若干件放在空間為W的背包里，每件物品的體積為W1暂论，W2……Wn，與之相對(duì)應(yīng)的價(jià)值為P1,P...

622 0 0
202. Happy Number(數(shù)值轉(zhuǎn)字符串)
Write an algorithm to determine if a number is "happy". A happy number i...

382 0 0
13.Roman to Integer(find()函數(shù))
Given a roman numeral, convert it to an integer.Input is guaranteed to b...

158 0 0
283. Move Zeroes （Vector的erase和remove）
Given an array nums, write a function to move all 0's to the end of it w...

410 0 1

371. Sum of Two Integers（位操作）
Calculate the sum of two integers a and b, but you are not allowed to us...

261 0 0