15. 3Sum In this problem, we use three pointers to get no repeating tupl...
通過觀察面積公式,如果我們想讓面積最大,就要讓(right_index - left_index)由最大值向0收斂,并且盡可能地提高M(jìn)in(he...
198. House Robber You are a professional robber planning to rob houses a...
動(dòng)態(tài)規(guī)劃的解法 空間壓縮 由于第i行的f[i][j]只由第i行和第i - 1行的數(shù)據(jù)所決定,所以我們可以進(jìn)行空間復(fù)用,把空間復(fù)雜度從O(m * ...
動(dòng)態(tài)規(guī)劃的解法 不得不吐槽一句,這題直接用DP來做有點(diǎn)麻煩!首先兩個(gè)初始條件你都得想到,除此之外,因?yàn)槭莃ottom-up的動(dòng)態(tài)規(guī)劃,還得考慮計(jì)...
104. Maximum Depth of Binary Tree 這題很簡(jiǎn)單,只要理解樹的深度 = max{ 左子樹深度, 右子樹深度} + ...
674. Longest Continuous Increasing Subsequence 設(shè)f[i]為:以a[i]結(jié)尾的最長(zhǎng)連續(xù)上升子序列的...
[LeetCode] Paint House 256. Paint House I 根據(jù)題意我們知道,粉刷第i棟房子的顏色,依賴于第i - 1棟...