碼農(nóng)一枚棚亩，懷揣著最初的夢(mèng)想去打拼，生活有很多困難辙谜，但辦法總比困難多，不忘初心，繼續(xù)前行狞贱。<br>個(gè)人公眾號(hào)：碼小白TM<br>個(gè)人博客：<a href="https://links.jianshu.com/go?to=https%3A%2F%2Fwww.keepupcoder.com%2F" target="_blank">https://www.keepupcoder.com/</a>
IP屬地：加州
-
-
個(gè)人公眾號(hào) 柳樹(shù)的絮叨叨
-
十大排序排序大體可分為兩類(lèi)瞎嬉，基于比較的和不基于比較的。 計(jì)數(shù)排序厚柳，桶排序和基數(shù)排序不基于比較氧枣。 冒泡排序 bubble sort對(duì)于相鄰兩個(gè)數(shù)，如果前者大于后者别垮，交換完成一輪后會(huì)選出...
-
愿意為你解答關(guān)于簡(jiǎn)書(shū)鉆的一切疑問(wèn)~<br><br>買(mǎi)簡(jiǎn)書(shū)會(huì)員 <a href="http://www.reibang.com/mobile/club?ref=676146d9" target="_blank">http://www.reibang.com/mobile/club?ref=676146d9</a>
-
Deque
1019一開(kāi)始用stack比較慢宰闰，后來(lái)用deque很快茬贵，為什么？deque的數(shù)據(jù)結(jié)構(gòu) Deque的基本方法deque方法.png單調(diào)隊(duì)列移袍，洛谷[洛谷日?qǐng)?bào)第9期]淺談單調(diào)隊(duì)列J...
-
區(qū)塊鏈學(xué)習(xí)中
-
初等數(shù)論四大基本定理
四大基本定理威爾遜定理歐拉定理中國(guó)剩余定理費(fèi)馬小定理 歐幾里得算法 (求greatest common divisor)gcd(a, b) = gcd(a - b, b) ...
-
區(qū)間DP
石子歸并P1880. 石子合并 （每次合并兩個(gè)葡盗，圓形操場(chǎng)）1000. Minimum Cost to Merge Stones （每次合并K個(gè)）312. Burst Ball...
-
樹(shù)狀DP求??高104. Maximum Depth of Binary Tree559. Maximum Depth of N-ary Tree ??中最長(zhǎng)鏈1245. Tree Di...
-
315. Count of Smaller Numbers After Self
經(jīng)典題螟左，三種方法解決 樹(shù)狀數(shù)組將數(shù)組轉(zhuǎn)變成rank數(shù)組及其頻率loop from end to beginning 線段樹(shù)相同的思路，都是維持rank數(shù)組用線段樹(shù)求prefi...
-
leetcode中的背包DP變型
416. Partition Equal Subset Sum0-1 背包觅够，能否裝滿胶背，可行性分析自頂向下和自底向上都可以 494. Target Sum0-1 背包，最多裝滿...
-
KMP28. Implement strStr()459. Repeated Substring Pattern1392. Longest Happy Prefix (KMP求ne...
-
bipartite graph 二分圖
a graph is bipartite if we can split it's set of nodes into two independent subsets A a...
-
Flow Control 流控制stop and wait has at most one packet in flight at any time sliding window TCP滑動(dòng)窗口
-
Fenwick Tree/Binary Indexed Tree (BIT)307. Range Sum Query - Mutable308. Range Sum Query 2D - MutableBinary Indexed Tree or F...
-
Range Sum所有題喘先， Immutable的題用prefix sum钳吟，Mutable的題用Segment Tree303. Range Sum Query - Immutable304. ...
-
最小生成樹(shù)
1135. Connecting Cities With Minimum Cost1168. Optimize Water Distribution in a Village
-
OTTFF報(bào)菜名
線性動(dòng)態(tài)規(guī)劃 線性動(dòng)態(tài)規(guī)劃 （共六題）[https://blog.csdn.net/ctsas/article/details/75578741] 斐波那契70. Climb...
-
背包問(wèn)題
0-1背包和完全背包的逆序和正序lintcode背包問(wèn)題匯總LeetCode動(dòng)態(tài)規(guī)劃刷題記錄（一）背包問(wèn)題ACWing中有足夠的背包問(wèn)題 92. Backpack0-1背包，...
-
買(mǎi)賣(mài)股票系列
121. Best Time to Buy and Sell Stock122. Best Time to Buy and Sell Stock II123. Best Ti...
