發(fā)簡信
IP屬地：重慶
-
python a in list與 a in dict.keys()
想在一個列表中確認(rèn)是否存在某個元素:通常使用 a in list,但是這是個O(n)的操作,非常慢 而 a in dict.keys() 是O...
-
#238. Product of Array Except Selfhttps://leetcode.com/problems/product-of-array-except-self/#/description...
-
#495. Teemo Attacking
https://leetcode.com/problems/teemo-attacking/#/description 題目過長 這里就不放啦 ...
-
#283. Move Zeroeshttps://leetcode.com/problems/move-zeroes/#/description Python 遇到非零元素則替換...
-
#442. Find All Duplicates in an Arrayhttps://leetcode.com/problems/find-all-duplicates-in-an-array/#/descript...
-
#566. Reshape the Matrixhttps://leetcode.com/problems/reshape-the-matrix/#/hints 思路 關(guān)鍵就是原矩陣和resh...
-
#561. Array Partition Ihttps://leetcode.com/problems/array-partition-i/#/description 翻譯 將長度為2n的...
-
303. Range Sum Query - Immutablehttps://leetcode.com/problems/range-sum-query-immutable/#/description 方法...
-
#53. Maximum Subarrayhttps://leetcode.com/problems/maximum-subarray/#/description 說明 查找連續(xù)子數(shù)組，...