C++用 -1 mask法達到branchless解Leetcode1513 Number of Substrings With Only 1s|Py3 1-liner
其實很容易，想練功，試試一行解，或是把if分岔拿掉
[C++無分岔解請進]
herrDeng網內搜尋
自訂搜尋
訂閱：
意見 (Atom)
熱門文章
-
url="https://www.twse.com.tw/exchangeReport/STOCK_DAY?response=json&date=20220330&stockNo=2330"
-
連續複利
-
py3 cpp Line sweep解Leetcode 3346 Maximum Frequency of an Element After Performing Operations I 使用 line sweep不用排序，可得線性解 [Py3解請進]
-
請用Random產生20個0~99的奇數(可重複)，然後排序
-
C++ py3 C Rust adjacent difference與loop速解Leetcode 1526 Minimum Number of Increments on Subarrays to Form a Target Array [Py3一行解請進]
-
輸入公元n年，輸出"平年" "閏年"
-
int a[]={21, 23, 57, 13 ,17, 6}; float average; average=?
-
Py3 C++導出遞迴公式解難題Leetcode1611 Minimum One Bit Operations to Make Integers Zero從導出公式到寫出code，一次完成解Leetcode難題 [C++一行解請進]
