發(fā)簡(jiǎn)信
IP屬地：廣西
-
Mac平臺(tái)docker鏡像操作加速你是否遇到拉取docker鏡像很慢甚至失敗的問(wèn)題，shadowsocks 也沒(méi)用，這時(shí)候你需要修改鏡像源來(lái)加速： Docker for Mac ...
-
開(kāi)始使用快捷鍵
你了解瀏覽器標(biāo)簽頁(yè)之間怎么快速切換嗎？你知道怎么使用快捷鍵切換地址欄是否打開(kāi)嗎？如果你和我一樣每天都要花幾個(gè)小時(shí)用在瀏覽器上，那就是時(shí)候花點(diǎn)時(shí)間...
-
[LeetCode By Go 747] Easy, Array, 747. Largest Number At Least Twice of Others
題目 In a given integer array nums, there is always exactly one largest el...
-
[LeetCode By Go 724] Easy, Array, 724. Find Pivot Index
題目 Given an array of integers nums, write a method that returns the "piv...
-
[LeetCode By Go 108]438. Find All Anagrams in a String
題目的通過(guò)率越來(lái)越低，題目越來(lái)越長(zhǎng)，題意不好理解，邊界問(wèn)題，優(yōu)化問(wèn)題疊加，導(dǎo)致解題時(shí)間大大增加，對(duì)我的目標(biāo)--快速?gòu)?fù)習(xí)一遍技術(shù)數(shù)據(jù)結(jié)構(gòu)和算法阻礙...
-
[LeetCode By Go 107]507. Perfect Number
題目 We define the Perfect Number is a positive integer that is equal to t...
-
[LeetCode By Go 106]205. Isomorphic Strings
這個(gè)題目思路比較好想，但是邊界問(wèn)題好難搞，測(cè)了好多次才成功。 題目 Given two strings s and t, determine i...
-
[LeetCode By Go 105]112. Path Sum
題目 Given a binary tree and a sum, determine if the tree has a root-to-le...
-
[LeetCode By Go 104]38. Count and Say
題目 The count-and-say sequence is the sequence of integers with the first...